./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 54858612 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.0-5485861 [2020-10-25 21:18:38,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 21:18:38,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 21:18:38,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 21:18:38,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 21:18:38,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 21:18:38,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 21:18:38,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 21:18:38,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 21:18:38,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 21:18:38,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 21:18:38,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 21:18:38,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 21:18:38,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 21:18:38,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 21:18:38,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 21:18:38,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 21:18:38,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 21:18:38,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 21:18:38,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 21:18:38,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 21:18:38,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 21:18:38,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 21:18:38,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 21:18:38,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 21:18:38,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 21:18:38,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 21:18:38,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 21:18:38,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 21:18:38,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 21:18:38,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 21:18:38,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 21:18:38,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 21:18:38,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 21:18:38,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 21:18:38,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 21:18:38,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 21:18:38,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 21:18:38,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 21:18:38,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 21:18:38,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 21:18:38,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 21:18:38,391 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 21:18:38,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 21:18:38,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 21:18:38,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 21:18:38,396 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 21:18:38,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 21:18:38,397 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 21:18:38,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 21:18:38,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 21:18:38,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 21:18:38,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 21:18:38,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 21:18:38,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 21:18:38,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 21:18:38,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 21:18:38,401 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 21:18:38,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 21:18:38,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 21:18:38,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 21:18:38,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 21:18:38,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 21:18:38,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:18:38,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 21:18:38,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 21:18:38,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 21:18:38,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 21:18:38,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 21:18:38,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 21:18:38,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 21:18:38,405 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 [2020-10-25 21:18:38,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 21:18:38,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 21:18:38,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 21:18:38,838 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 21:18:38,841 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 21:18:38,842 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 [2020-10-25 21:18:38,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7617da2/3a2b4141d5a346feab9ca011a1f97ccd/FLAG21654bcfd [2020-10-25 21:18:39,662 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 21:18:39,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-10-25 21:18:39,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7617da2/3a2b4141d5a346feab9ca011a1f97ccd/FLAG21654bcfd [2020-10-25 21:18:39,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7617da2/3a2b4141d5a346feab9ca011a1f97ccd [2020-10-25 21:18:39,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 21:18:39,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 21:18:39,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 21:18:39,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 21:18:39,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 21:18:39,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:18:39" (1/1) ... [2020-10-25 21:18:39,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92744ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:39, skipping insertion in model container [2020-10-25 21:18:39,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:18:39" (1/1) ... [2020-10-25 21:18:40,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 21:18:40,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 21:18:40,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:18:40,399 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 21:18:40,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:18:40,525 INFO L208 MainTranslator]: Completed translation [2020-10-25 21:18:40,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40 WrapperNode [2020-10-25 21:18:40,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 21:18:40,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 21:18:40,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 21:18:40,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 21:18:40,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 21:18:40,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 21:18:40,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 21:18:40,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 21:18:40,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... [2020-10-25 21:18:40,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 21:18:40,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 21:18:40,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 21:18:40,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 21:18:40,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:18:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 21:18:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 21:18:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 21:18:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 21:18:41,896 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 21:18:41,897 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-25 21:18:41,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:18:41 BoogieIcfgContainer [2020-10-25 21:18:41,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 21:18:41,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 21:18:41,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 21:18:41,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 21:18:41,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 09:18:39" (1/3) ... [2020-10-25 21:18:41,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3079db56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:18:41, skipping insertion in model container [2020-10-25 21:18:41,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:18:40" (2/3) ... [2020-10-25 21:18:41,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3079db56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:18:41, skipping insertion in model container [2020-10-25 21:18:41,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:18:41" (3/3) ... [2020-10-25 21:18:41,910 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2020-10-25 21:18:41,922 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 21:18:41,928 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 21:18:41,942 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 21:18:41,972 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 21:18:41,972 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 21:18:41,972 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 21:18:41,973 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 21:18:41,973 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 21:18:41,973 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 21:18:41,973 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 21:18:41,973 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 21:18:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-10-25 21:18:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 21:18:41,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:41,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:42,000 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2020-10-25 21:18:42,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:42,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801175424] [2020-10-25 21:18:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:42,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801175424] [2020-10-25 21:18:42,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:42,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 21:18:42,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97208803] [2020-10-25 21:18:42,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 21:18:42,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 21:18:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:18:42,218 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2020-10-25 21:18:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:42,261 INFO L93 Difference]: Finished difference Result 219 states and 421 transitions. [2020-10-25 21:18:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 21:18:42,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-25 21:18:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:42,276 INFO L225 Difference]: With dead ends: 219 [2020-10-25 21:18:42,276 INFO L226 Difference]: Without dead ends: 106 [2020-10-25 21:18:42,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:18:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-25 21:18:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-25 21:18:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-25 21:18:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2020-10-25 21:18:42,328 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2020-10-25 21:18:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:42,329 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2020-10-25 21:18:42,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 21:18:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2020-10-25 21:18:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 21:18:42,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:42,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:42,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 21:18:42,331 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2020-10-25 21:18:42,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:42,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760130500] [2020-10-25 21:18:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:42,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760130500] [2020-10-25 21:18:42,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:42,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:42,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256307651] [2020-10-25 21:18:42,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:42,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:42,409 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2020-10-25 21:18:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:42,478 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2020-10-25 21:18:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:42,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-25 21:18:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:42,481 INFO L225 Difference]: With dead ends: 214 [2020-10-25 21:18:42,481 INFO L226 Difference]: Without dead ends: 110 [2020-10-25 21:18:42,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-25 21:18:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-25 21:18:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-25 21:18:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2020-10-25 21:18:42,497 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2020-10-25 21:18:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:42,498 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2020-10-25 21:18:42,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2020-10-25 21:18:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 21:18:42,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:42,500 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:42,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 21:18:42,500 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2020-10-25 21:18:42,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:42,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860989444] [2020-10-25 21:18:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:42,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860989444] [2020-10-25 21:18:42,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:42,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:42,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601877926] [2020-10-25 21:18:42,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:42,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:42,679 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2020-10-25 21:18:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:42,931 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2020-10-25 21:18:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:42,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-25 21:18:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:42,935 INFO L225 Difference]: With dead ends: 324 [2020-10-25 21:18:42,935 INFO L226 Difference]: Without dead ends: 195 [2020-10-25 21:18:42,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-10-25 21:18:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2020-10-25 21:18:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-25 21:18:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2020-10-25 21:18:42,952 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2020-10-25 21:18:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:42,952 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2020-10-25 21:18:42,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2020-10-25 21:18:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 21:18:42,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:42,954 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:42,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 21:18:42,955 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2020-10-25 21:18:42,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:42,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117435909] [2020-10-25 21:18:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:43,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117435909] [2020-10-25 21:18:43,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:43,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:43,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045194740] [2020-10-25 21:18:43,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:43,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:43,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:43,010 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2020-10-25 21:18:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:43,149 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2020-10-25 21:18:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:43,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-25 21:18:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:43,152 INFO L225 Difference]: With dead ends: 314 [2020-10-25 21:18:43,152 INFO L226 Difference]: Without dead ends: 133 [2020-10-25 21:18:43,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-25 21:18:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-10-25 21:18:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-25 21:18:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2020-10-25 21:18:43,165 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2020-10-25 21:18:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:43,166 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2020-10-25 21:18:43,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2020-10-25 21:18:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 21:18:43,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:43,168 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:43,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 21:18:43,168 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2020-10-25 21:18:43,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:43,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116822794] [2020-10-25 21:18:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 21:18:43,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116822794] [2020-10-25 21:18:43,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:43,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:43,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744442515] [2020-10-25 21:18:43,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:43,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:43,240 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2020-10-25 21:18:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:43,294 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2020-10-25 21:18:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:43,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 21:18:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:43,297 INFO L225 Difference]: With dead ends: 243 [2020-10-25 21:18:43,297 INFO L226 Difference]: Without dead ends: 115 [2020-10-25 21:18:43,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-25 21:18:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2020-10-25 21:18:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-25 21:18:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2020-10-25 21:18:43,312 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2020-10-25 21:18:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:43,312 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2020-10-25 21:18:43,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2020-10-25 21:18:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 21:18:43,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:43,315 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:43,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 21:18:43,315 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:43,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2020-10-25 21:18:43,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:43,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030375591] [2020-10-25 21:18:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:43,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030375591] [2020-10-25 21:18:43,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109524632] [2020-10-25 21:18:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:43,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 21:18:43,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:43,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:43,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-25 21:18:43,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630155597] [2020-10-25 21:18:43,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 21:18:43,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:43,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 21:18:43,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:43,704 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2020-10-25 21:18:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:44,007 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2020-10-25 21:18:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 21:18:44,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-25 21:18:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:44,011 INFO L225 Difference]: With dead ends: 204 [2020-10-25 21:18:44,011 INFO L226 Difference]: Without dead ends: 192 [2020-10-25 21:18:44,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-25 21:18:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2020-10-25 21:18:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-25 21:18:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2020-10-25 21:18:44,027 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2020-10-25 21:18:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:44,027 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2020-10-25 21:18:44,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 21:18:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2020-10-25 21:18:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 21:18:44,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:44,029 INFO L422 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] [2020-10-25 21:18:44,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-25 21:18:44,243 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2020-10-25 21:18:44,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:44,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45780754] [2020-10-25 21:18:44,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:44,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45780754] [2020-10-25 21:18:44,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518256462] [2020-10-25 21:18:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:44,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 21:18:44,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:44,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:44,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-25 21:18:44,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759026781] [2020-10-25 21:18:44,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 21:18:44,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 21:18:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:44,605 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2020-10-25 21:18:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:44,823 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2020-10-25 21:18:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:18:44,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-25 21:18:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:44,826 INFO L225 Difference]: With dead ends: 387 [2020-10-25 21:18:44,826 INFO L226 Difference]: Without dead ends: 230 [2020-10-25 21:18:44,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-25 21:18:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2020-10-25 21:18:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-25 21:18:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2020-10-25 21:18:44,864 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2020-10-25 21:18:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:44,865 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2020-10-25 21:18:44,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 21:18:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2020-10-25 21:18:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 21:18:44,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:44,867 INFO L422 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] [2020-10-25 21:18:45,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:45,083 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2020-10-25 21:18:45,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:45,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445187886] [2020-10-25 21:18:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-25 21:18:45,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445187886] [2020-10-25 21:18:45,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:45,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:45,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947040620] [2020-10-25 21:18:45,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:45,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:45,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:45,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:45,167 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2020-10-25 21:18:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:45,218 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2020-10-25 21:18:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:45,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 21:18:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:45,225 INFO L225 Difference]: With dead ends: 409 [2020-10-25 21:18:45,226 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 21:18:45,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 21:18:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-10-25 21:18:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-25 21:18:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2020-10-25 21:18:45,242 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2020-10-25 21:18:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:45,243 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2020-10-25 21:18:45,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2020-10-25 21:18:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 21:18:45,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:45,252 INFO L422 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] [2020-10-25 21:18:45,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 21:18:45,253 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2020-10-25 21:18:45,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:45,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134426327] [2020-10-25 21:18:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:45,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134426327] [2020-10-25 21:18:45,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:45,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:45,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302549061] [2020-10-25 21:18:45,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:45,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:45,316 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2020-10-25 21:18:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:45,350 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2020-10-25 21:18:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:45,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 21:18:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:45,353 INFO L225 Difference]: With dead ends: 375 [2020-10-25 21:18:45,354 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 21:18:45,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 21:18:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-10-25 21:18:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-25 21:18:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2020-10-25 21:18:45,371 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2020-10-25 21:18:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:45,371 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2020-10-25 21:18:45,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2020-10-25 21:18:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 21:18:45,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:45,373 INFO L422 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] [2020-10-25 21:18:45,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 21:18:45,374 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2020-10-25 21:18:45,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:45,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893857945] [2020-10-25 21:18:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:45,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893857945] [2020-10-25 21:18:45,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646030676] [2020-10-25 21:18:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:45,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 21:18:45,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 21:18:45,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:45,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-10-25 21:18:45,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037471756] [2020-10-25 21:18:45,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 21:18:45,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:45,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 21:18:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:18:45,808 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 7 states. [2020-10-25 21:18:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:46,235 INFO L93 Difference]: Finished difference Result 490 states and 766 transitions. [2020-10-25 21:18:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 21:18:46,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-10-25 21:18:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:46,238 INFO L225 Difference]: With dead ends: 490 [2020-10-25 21:18:46,239 INFO L226 Difference]: Without dead ends: 275 [2020-10-25 21:18:46,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:18:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-25 21:18:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2020-10-25 21:18:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-25 21:18:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2020-10-25 21:18:46,253 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2020-10-25 21:18:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:46,255 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2020-10-25 21:18:46,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 21:18:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2020-10-25 21:18:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-25 21:18:46,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:46,259 INFO L422 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] [2020-10-25 21:18:46,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-25 21:18:46,474 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2020-10-25 21:18:46,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:46,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258154798] [2020-10-25 21:18:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 21:18:46,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258154798] [2020-10-25 21:18:46,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877886459] [2020-10-25 21:18:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:46,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 21:18:46,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 21:18:46,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:46,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-25 21:18:46,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410804874] [2020-10-25 21:18:46,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:18:46,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:18:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:18:46,712 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2020-10-25 21:18:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:46,852 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2020-10-25 21:18:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:18:46,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-10-25 21:18:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:46,855 INFO L225 Difference]: With dead ends: 274 [2020-10-25 21:18:46,855 INFO L226 Difference]: Without dead ends: 262 [2020-10-25 21:18:46,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:18:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-25 21:18:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-10-25 21:18:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-25 21:18:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2020-10-25 21:18:46,865 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2020-10-25 21:18:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:46,865 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2020-10-25 21:18:46,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:18:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2020-10-25 21:18:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-25 21:18:46,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:46,866 INFO L422 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] [2020-10-25 21:18:47,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:47,081 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2020-10-25 21:18:47,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:47,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141083240] [2020-10-25 21:18:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:47,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141083240] [2020-10-25 21:18:47,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091954490] [2020-10-25 21:18:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:47,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 21:18:47,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:47,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:47,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-25 21:18:47,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743277964] [2020-10-25 21:18:47,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:18:47,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:18:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:18:47,421 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2020-10-25 21:18:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:47,606 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2020-10-25 21:18:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:18:47,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-10-25 21:18:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:47,609 INFO L225 Difference]: With dead ends: 271 [2020-10-25 21:18:47,609 INFO L226 Difference]: Without dead ends: 269 [2020-10-25 21:18:47,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:18:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-25 21:18:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2020-10-25 21:18:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-10-25 21:18:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2020-10-25 21:18:47,620 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2020-10-25 21:18:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:47,620 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2020-10-25 21:18:47,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:18:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2020-10-25 21:18:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-25 21:18:47,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:47,622 INFO L422 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] [2020-10-25 21:18:47,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-25 21:18:47,836 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2020-10-25 21:18:47,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:47,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517160531] [2020-10-25 21:18:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:47,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517160531] [2020-10-25 21:18:47,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:47,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:47,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746209248] [2020-10-25 21:18:47,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:47,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:47,883 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2020-10-25 21:18:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:47,919 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2020-10-25 21:18:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:47,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-10-25 21:18:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:47,922 INFO L225 Difference]: With dead ends: 461 [2020-10-25 21:18:47,922 INFO L226 Difference]: Without dead ends: 245 [2020-10-25 21:18:47,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-25 21:18:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2020-10-25 21:18:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-25 21:18:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2020-10-25 21:18:47,931 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2020-10-25 21:18:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:47,931 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2020-10-25 21:18:47,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2020-10-25 21:18:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 21:18:47,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:47,932 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-10-25 21:18:47,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 21:18:47,933 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2020-10-25 21:18:47,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:47,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654914874] [2020-10-25 21:18:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-25 21:18:48,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654914874] [2020-10-25 21:18:48,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:18:48,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 21:18:48,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723212198] [2020-10-25 21:18:48,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 21:18:48,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 21:18:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:48,006 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2020-10-25 21:18:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:48,045 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2020-10-25 21:18:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:18:48,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-25 21:18:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:48,048 INFO L225 Difference]: With dead ends: 333 [2020-10-25 21:18:48,048 INFO L226 Difference]: Without dead ends: 155 [2020-10-25 21:18:48,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 21:18:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-25 21:18:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-10-25 21:18:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-25 21:18:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2020-10-25 21:18:48,056 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2020-10-25 21:18:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:48,056 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2020-10-25 21:18:48,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 21:18:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2020-10-25 21:18:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-25 21:18:48,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:48,058 INFO L422 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] [2020-10-25 21:18:48,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 21:18:48,058 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2020-10-25 21:18:48,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:48,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7932910] [2020-10-25 21:18:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 21:18:48,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7932910] [2020-10-25 21:18:48,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893206152] [2020-10-25 21:18:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 21:18:48,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 21:18:48,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:48,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-25 21:18:48,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101177438] [2020-10-25 21:18:48,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 21:18:48,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 21:18:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:48,322 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2020-10-25 21:18:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:48,432 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2020-10-25 21:18:48,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 21:18:48,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-10-25 21:18:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:48,434 INFO L225 Difference]: With dead ends: 286 [2020-10-25 21:18:48,434 INFO L226 Difference]: Without dead ends: 194 [2020-10-25 21:18:48,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 21:18:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-25 21:18:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2020-10-25 21:18:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-25 21:18:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2020-10-25 21:18:48,441 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2020-10-25 21:18:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:48,441 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2020-10-25 21:18:48,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 21:18:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2020-10-25 21:18:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-25 21:18:48,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:48,443 INFO L422 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] [2020-10-25 21:18:48,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:48,656 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2020-10-25 21:18:48,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:48,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719297833] [2020-10-25 21:18:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:48,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719297833] [2020-10-25 21:18:48,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88685162] [2020-10-25 21:18:48,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:48,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 21:18:48,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:49,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:49,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-25 21:18:49,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789016210] [2020-10-25 21:18:49,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 21:18:49,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 21:18:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:18:49,003 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 7 states. [2020-10-25 21:18:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:49,147 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2020-10-25 21:18:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:18:49,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-10-25 21:18:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:49,150 INFO L225 Difference]: With dead ends: 193 [2020-10-25 21:18:49,150 INFO L226 Difference]: Without dead ends: 191 [2020-10-25 21:18:49,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:18:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-25 21:18:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-10-25 21:18:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-25 21:18:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2020-10-25 21:18:49,160 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2020-10-25 21:18:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:49,161 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2020-10-25 21:18:49,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 21:18:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2020-10-25 21:18:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 21:18:49,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:49,162 INFO L422 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] [2020-10-25 21:18:49,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-25 21:18:49,364 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2020-10-25 21:18:49,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:49,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789306616] [2020-10-25 21:18:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:49,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789306616] [2020-10-25 21:18:49,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955095977] [2020-10-25 21:18:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:49,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 21:18:49,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:49,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:49,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-25 21:18:49,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006736040] [2020-10-25 21:18:49,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 21:18:49,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 21:18:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:18:49,804 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 8 states. [2020-10-25 21:18:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:49,947 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2020-10-25 21:18:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 21:18:49,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-10-25 21:18:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:49,949 INFO L225 Difference]: With dead ends: 196 [2020-10-25 21:18:49,949 INFO L226 Difference]: Without dead ends: 194 [2020-10-25 21:18:49,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:18:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-25 21:18:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-10-25 21:18:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-25 21:18:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2020-10-25 21:18:49,957 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2020-10-25 21:18:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:49,958 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2020-10-25 21:18:49,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 21:18:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2020-10-25 21:18:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-25 21:18:49,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:49,959 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:50,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-25 21:18:50,174 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2020-10-25 21:18:50,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:50,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921943111] [2020-10-25 21:18:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:50,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921943111] [2020-10-25 21:18:50,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727778122] [2020-10-25 21:18:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:50,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-25 21:18:50,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:50,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:50,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-10-25 21:18:50,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081306215] [2020-10-25 21:18:50,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 21:18:50,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:50,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 21:18:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-25 21:18:50,723 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 12 states. [2020-10-25 21:18:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:50,966 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2020-10-25 21:18:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 21:18:50,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-25 21:18:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:50,969 INFO L225 Difference]: With dead ends: 301 [2020-10-25 21:18:50,969 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 21:18:50,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:18:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 21:18:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-10-25 21:18:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-25 21:18:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2020-10-25 21:18:50,977 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2020-10-25 21:18:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:50,977 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-10-25 21:18:50,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 21:18:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2020-10-25 21:18:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-25 21:18:50,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:50,979 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:51,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-25 21:18:51,194 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2020-10-25 21:18:51,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:51,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144799409] [2020-10-25 21:18:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:51,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144799409] [2020-10-25 21:18:51,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002626403] [2020-10-25 21:18:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:51,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-25 21:18:51,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 21:18:51,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:51,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-10-25 21:18:51,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816179662] [2020-10-25 21:18:51,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 21:18:51,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 21:18:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-25 21:18:51,756 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 9 states. [2020-10-25 21:18:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:52,087 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2020-10-25 21:18:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 21:18:52,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2020-10-25 21:18:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:52,089 INFO L225 Difference]: With dead ends: 329 [2020-10-25 21:18:52,089 INFO L226 Difference]: Without dead ends: 239 [2020-10-25 21:18:52,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-25 21:18:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-10-25 21:18:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2020-10-25 21:18:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 21:18:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2020-10-25 21:18:52,105 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2020-10-25 21:18:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:52,106 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2020-10-25 21:18:52,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 21:18:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2020-10-25 21:18:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-25 21:18:52,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:52,107 INFO L422 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] [2020-10-25 21:18:52,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:52,321 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2020-10-25 21:18:52,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:52,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927452161] [2020-10-25 21:18:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:52,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927452161] [2020-10-25 21:18:52,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900731227] [2020-10-25 21:18:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:52,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2020-10-25 21:18:52,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:53,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:53,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-10-25 21:18:53,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076123301] [2020-10-25 21:18:53,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 21:18:53,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 21:18:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:18:53,005 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 13 states. [2020-10-25 21:18:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:53,432 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2020-10-25 21:18:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 21:18:53,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2020-10-25 21:18:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:53,435 INFO L225 Difference]: With dead ends: 233 [2020-10-25 21:18:53,435 INFO L226 Difference]: Without dead ends: 231 [2020-10-25 21:18:53,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-25 21:18:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-25 21:18:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-10-25 21:18:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-25 21:18:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2020-10-25 21:18:53,448 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2020-10-25 21:18:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:53,448 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2020-10-25 21:18:53,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 21:18:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2020-10-25 21:18:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 21:18:53,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:53,450 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:53,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:53,654 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2020-10-25 21:18:53,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:53,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808147462] [2020-10-25 21:18:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 21:18:53,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808147462] [2020-10-25 21:18:53,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495348299] [2020-10-25 21:18:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:53,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-25 21:18:53,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-25 21:18:54,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:54,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-25 21:18:54,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533792757] [2020-10-25 21:18:54,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 21:18:54,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 21:18:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:18:54,057 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2020-10-25 21:18:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:54,233 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2020-10-25 21:18:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 21:18:54,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2020-10-25 21:18:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:54,235 INFO L225 Difference]: With dead ends: 364 [2020-10-25 21:18:54,235 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 21:18:54,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:18:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 21:18:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-10-25 21:18:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-25 21:18:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2020-10-25 21:18:54,254 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2020-10-25 21:18:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:54,254 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2020-10-25 21:18:54,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 21:18:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2020-10-25 21:18:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-25 21:18:54,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:54,256 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:54,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:54,458 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2020-10-25 21:18:54,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:54,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706859188] [2020-10-25 21:18:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:54,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706859188] [2020-10-25 21:18:54,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023891010] [2020-10-25 21:18:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:54,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-25 21:18:54,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:55,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:55,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-25 21:18:55,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949237572] [2020-10-25 21:18:55,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 21:18:55,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 21:18:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-25 21:18:55,078 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 14 states. [2020-10-25 21:18:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:55,452 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2020-10-25 21:18:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 21:18:55,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-10-25 21:18:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:55,455 INFO L225 Difference]: With dead ends: 271 [2020-10-25 21:18:55,455 INFO L226 Difference]: Without dead ends: 269 [2020-10-25 21:18:55,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-10-25 21:18:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-25 21:18:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-10-25 21:18:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-25 21:18:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2020-10-25 21:18:55,466 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2020-10-25 21:18:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:55,466 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2020-10-25 21:18:55,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 21:18:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2020-10-25 21:18:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-25 21:18:55,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:55,468 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:55,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-25 21:18:55,683 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2020-10-25 21:18:55,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:55,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027036545] [2020-10-25 21:18:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-25 21:18:56,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027036545] [2020-10-25 21:18:56,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156356088] [2020-10-25 21:18:56,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:56,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:18:56,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:18:56,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-25 21:18:56,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:56,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:56,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2020-10-25 21:18:56,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296866202] [2020-10-25 21:18:56,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 21:18:56,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 21:18:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-10-25 21:18:56,461 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 16 states. [2020-10-25 21:18:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:56,882 INFO L93 Difference]: Finished difference Result 274 states and 383 transitions. [2020-10-25 21:18:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 21:18:56,883 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-10-25 21:18:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:56,885 INFO L225 Difference]: With dead ends: 274 [2020-10-25 21:18:56,885 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 21:18:56,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-10-25 21:18:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 21:18:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2020-10-25 21:18:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-25 21:18:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2020-10-25 21:18:56,897 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2020-10-25 21:18:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:56,898 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2020-10-25 21:18:56,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 21:18:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2020-10-25 21:18:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-25 21:18:56,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:56,900 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:57,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:57,113 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:57,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2020-10-25 21:18:57,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:57,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109897699] [2020-10-25 21:18:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 21:18:57,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109897699] [2020-10-25 21:18:57,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086987210] [2020-10-25 21:18:57,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:57,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:18:57,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:18:57,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-25 21:18:57,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:18:57,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:57,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2020-10-25 21:18:57,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286258526] [2020-10-25 21:18:57,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-25 21:18:57,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-25 21:18:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-10-25 21:18:57,827 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 18 states. [2020-10-25 21:18:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:58,213 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2020-10-25 21:18:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 21:18:58,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 119 [2020-10-25 21:18:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:58,217 INFO L225 Difference]: With dead ends: 379 [2020-10-25 21:18:58,217 INFO L226 Difference]: Without dead ends: 289 [2020-10-25 21:18:58,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-10-25 21:18:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-25 21:18:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2020-10-25 21:18:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-10-25 21:18:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2020-10-25 21:18:58,227 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2020-10-25 21:18:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:58,228 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2020-10-25 21:18:58,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-25 21:18:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2020-10-25 21:18:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-25 21:18:58,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:58,230 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:58,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-10-25 21:18:58,444 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2020-10-25 21:18:58,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:58,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860330969] [2020-10-25 21:18:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:18:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 304 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 21:18:58,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860330969] [2020-10-25 21:18:58,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989762423] [2020-10-25 21:18:58,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:58,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:18:58,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:18:58,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-25 21:18:59,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:18:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 21:18:59,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:18:59,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-10-25 21:18:59,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659256671] [2020-10-25 21:18:59,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 21:18:59,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:18:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 21:18:59,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-25 21:18:59,120 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 11 states. [2020-10-25 21:18:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:18:59,611 INFO L93 Difference]: Finished difference Result 408 states and 578 transitions. [2020-10-25 21:18:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 21:18:59,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2020-10-25 21:18:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:18:59,614 INFO L225 Difference]: With dead ends: 408 [2020-10-25 21:18:59,614 INFO L226 Difference]: Without dead ends: 318 [2020-10-25 21:18:59,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-25 21:18:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-10-25 21:18:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2020-10-25 21:18:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-10-25 21:18:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2020-10-25 21:18:59,628 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2020-10-25 21:18:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:18:59,629 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2020-10-25 21:18:59,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 21:18:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2020-10-25 21:18:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-25 21:18:59,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:18:59,631 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:18:59,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:18:59,846 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:18:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:18:59,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2020-10-25 21:18:59,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:18:59,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946880005] [2020-10-25 21:18:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:18:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 21:19:00,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946880005] [2020-10-25 21:19:00,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975766386] [2020-10-25 21:19:00,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:00,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:19:00,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:00,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 45 conjunts are in the unsatisfiable core [2020-10-25 21:19:00,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:19:00,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:00,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2020-10-25 21:19:00,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005029590] [2020-10-25 21:19:00,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-25 21:19:00,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-25 21:19:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-10-25 21:19:00,829 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 19 states. [2020-10-25 21:19:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:01,182 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2020-10-25 21:19:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 21:19:01,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 132 [2020-10-25 21:19:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:01,185 INFO L225 Difference]: With dead ends: 311 [2020-10-25 21:19:01,185 INFO L226 Difference]: Without dead ends: 309 [2020-10-25 21:19:01,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2020-10-25 21:19:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-10-25 21:19:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2020-10-25 21:19:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-10-25 21:19:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2020-10-25 21:19:01,197 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2020-10-25 21:19:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:01,197 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2020-10-25 21:19:01,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-25 21:19:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2020-10-25 21:19:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-25 21:19:01,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:01,200 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:01,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-10-25 21:19:01,415 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2020-10-25 21:19:01,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:01,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123161754] [2020-10-25 21:19:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 21:19:01,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123161754] [2020-10-25 21:19:01,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511175694] [2020-10-25 21:19:01,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:01,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:19:01,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:01,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 26 conjunts are in the unsatisfiable core [2020-10-25 21:19:01,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 21:19:02,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:02,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-25 21:19:02,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389305003] [2020-10-25 21:19:02,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 21:19:02,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 21:19:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-25 21:19:02,055 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2020-10-25 21:19:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:02,328 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2020-10-25 21:19:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 21:19:02,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2020-10-25 21:19:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:02,331 INFO L225 Difference]: With dead ends: 442 [2020-10-25 21:19:02,331 INFO L226 Difference]: Without dead ends: 350 [2020-10-25 21:19:02,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-25 21:19:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-25 21:19:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2020-10-25 21:19:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-25 21:19:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2020-10-25 21:19:02,346 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2020-10-25 21:19:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:02,347 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2020-10-25 21:19:02,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 21:19:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2020-10-25 21:19:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-25 21:19:02,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:02,349 INFO L422 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] [2020-10-25 21:19:02,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-25 21:19:02,553 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2020-10-25 21:19:02,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:02,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482480394] [2020-10-25 21:19:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 21:19:02,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482480394] [2020-10-25 21:19:02,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408488044] [2020-10-25 21:19:02,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:03,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:19:03,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:03,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-25 21:19:03,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:19:03,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:03,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2020-10-25 21:19:03,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268880434] [2020-10-25 21:19:03,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 21:19:03,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:03,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 21:19:03,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2020-10-25 21:19:03,579 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 20 states. [2020-10-25 21:19:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:04,129 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2020-10-25 21:19:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-25 21:19:04,129 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 148 [2020-10-25 21:19:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:04,132 INFO L225 Difference]: With dead ends: 349 [2020-10-25 21:19:04,133 INFO L226 Difference]: Without dead ends: 347 [2020-10-25 21:19:04,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2020-10-25 21:19:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-25 21:19:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2020-10-25 21:19:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-25 21:19:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2020-10-25 21:19:04,145 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2020-10-25 21:19:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:04,146 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2020-10-25 21:19:04,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 21:19:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2020-10-25 21:19:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-10-25 21:19:04,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:04,148 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:04,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-25 21:19:04,363 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2020-10-25 21:19:04,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:04,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639687092] [2020-10-25 21:19:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 454 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 21:19:04,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639687092] [2020-10-25 21:19:04,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358204017] [2020-10-25 21:19:04,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:05,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-25 21:19:05,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:05,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 21:19:05,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 248 proven. 32 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-10-25 21:19:05,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:05,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-10-25 21:19:05,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741646322] [2020-10-25 21:19:05,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 21:19:05,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 21:19:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-10-25 21:19:05,277 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 16 states. [2020-10-25 21:19:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:06,839 INFO L93 Difference]: Finished difference Result 544 states and 765 transitions. [2020-10-25 21:19:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-25 21:19:06,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 155 [2020-10-25 21:19:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:06,843 INFO L225 Difference]: With dead ends: 544 [2020-10-25 21:19:06,843 INFO L226 Difference]: Without dead ends: 448 [2020-10-25 21:19:06,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2020-10-25 21:19:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-25 21:19:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2020-10-25 21:19:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-10-25 21:19:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2020-10-25 21:19:06,859 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2020-10-25 21:19:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:06,860 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2020-10-25 21:19:06,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 21:19:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2020-10-25 21:19:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-10-25 21:19:06,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:06,863 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:07,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-10-25 21:19:07,078 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2020-10-25 21:19:07,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:07,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033534745] [2020-10-25 21:19:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:07,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033534745] [2020-10-25 21:19:07,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256016924] [2020-10-25 21:19:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 21:19:07,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:07,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:07,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-25 21:19:07,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980861295] [2020-10-25 21:19:07,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 21:19:07,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 21:19:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-25 21:19:07,629 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 11 states. [2020-10-25 21:19:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:07,883 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2020-10-25 21:19:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 21:19:07,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2020-10-25 21:19:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:07,889 INFO L225 Difference]: With dead ends: 927 [2020-10-25 21:19:07,889 INFO L226 Difference]: Without dead ends: 760 [2020-10-25 21:19:07,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-25 21:19:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-10-25 21:19:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2020-10-25 21:19:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-10-25 21:19:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2020-10-25 21:19:07,915 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2020-10-25 21:19:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:07,916 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2020-10-25 21:19:07,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 21:19:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2020-10-25 21:19:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-25 21:19:07,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:07,919 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:08,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:08,133 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2020-10-25 21:19:08,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:08,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233070060] [2020-10-25 21:19:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 526 proven. 136 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:08,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233070060] [2020-10-25 21:19:08,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436019054] [2020-10-25 21:19:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:08,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-25 21:19:08,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-25 21:19:08,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 21:19:08,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2020-10-25 21:19:08,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720022441] [2020-10-25 21:19:08,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 21:19:08,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 21:19:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-25 21:19:08,854 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2020-10-25 21:19:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:09,019 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2020-10-25 21:19:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 21:19:09,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-10-25 21:19:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:09,025 INFO L225 Difference]: With dead ends: 860 [2020-10-25 21:19:09,025 INFO L226 Difference]: Without dead ends: 856 [2020-10-25 21:19:09,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-25 21:19:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2020-10-25 21:19:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2020-10-25 21:19:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-25 21:19:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2020-10-25 21:19:09,048 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2020-10-25 21:19:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:09,048 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2020-10-25 21:19:09,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 21:19:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2020-10-25 21:19:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-25 21:19:09,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:09,051 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:09,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:09,265 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2020-10-25 21:19:09,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:09,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890154518] [2020-10-25 21:19:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:09,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890154518] [2020-10-25 21:19:09,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020384983] [2020-10-25 21:19:09,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:10,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-10-25 21:19:10,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:10,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-25 21:19:10,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:10,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:10,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-10-25 21:19:10,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853051489] [2020-10-25 21:19:10,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-25 21:19:10,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:10,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-25 21:19:10,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-10-25 21:19:10,514 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 22 states. [2020-10-25 21:19:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:11,157 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2020-10-25 21:19:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-25 21:19:11,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2020-10-25 21:19:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:11,163 INFO L225 Difference]: With dead ends: 863 [2020-10-25 21:19:11,163 INFO L226 Difference]: Without dead ends: 861 [2020-10-25 21:19:11,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2020-10-25 21:19:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-25 21:19:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2020-10-25 21:19:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-25 21:19:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2020-10-25 21:19:11,189 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2020-10-25 21:19:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:11,190 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2020-10-25 21:19:11,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-25 21:19:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2020-10-25 21:19:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-25 21:19:11,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:11,193 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:11,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-10-25 21:19:11,408 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2020-10-25 21:19:11,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:11,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677378597] [2020-10-25 21:19:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-25 21:19:11,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677378597] [2020-10-25 21:19:11,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771128549] [2020-10-25 21:19:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:11,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 21:19:11,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-25 21:19:11,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:11,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-25 21:19:11,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071993289] [2020-10-25 21:19:11,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 21:19:11,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 21:19:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-25 21:19:11,972 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 12 states. [2020-10-25 21:19:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:12,209 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2020-10-25 21:19:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 21:19:12,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2020-10-25 21:19:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:12,215 INFO L225 Difference]: With dead ends: 1435 [2020-10-25 21:19:12,215 INFO L226 Difference]: Without dead ends: 959 [2020-10-25 21:19:12,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-25 21:19:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-10-25 21:19:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2020-10-25 21:19:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-25 21:19:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2020-10-25 21:19:12,244 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2020-10-25 21:19:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:12,245 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2020-10-25 21:19:12,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 21:19:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2020-10-25 21:19:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-25 21:19:12,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:12,248 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:12,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:12,464 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2020-10-25 21:19:12,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:12,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675289201] [2020-10-25 21:19:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:12,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675289201] [2020-10-25 21:19:12,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986820129] [2020-10-25 21:19:12,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:13,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-10-25 21:19:13,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:13,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-25 21:19:13,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 21:19:13,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:13,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-10-25 21:19:13,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805372933] [2020-10-25 21:19:13,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-25 21:19:13,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-25 21:19:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-10-25 21:19:13,640 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 24 states. [2020-10-25 21:19:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:14,362 INFO L93 Difference]: Finished difference Result 938 states and 1317 transitions. [2020-10-25 21:19:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-25 21:19:14,363 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2020-10-25 21:19:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:14,369 INFO L225 Difference]: With dead ends: 938 [2020-10-25 21:19:14,369 INFO L226 Difference]: Without dead ends: 936 [2020-10-25 21:19:14,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2020-10-25 21:19:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2020-10-25 21:19:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2020-10-25 21:19:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-25 21:19:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2020-10-25 21:19:14,395 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2020-10-25 21:19:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:14,395 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2020-10-25 21:19:14,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-25 21:19:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2020-10-25 21:19:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-10-25 21:19:14,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:14,399 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:14,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-10-25 21:19:14,615 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2020-10-25 21:19:14,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:14,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686572159] [2020-10-25 21:19:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-25 21:19:14,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686572159] [2020-10-25 21:19:14,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173938888] [2020-10-25 21:19:14,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:15,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:19:15,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:15,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-25 21:19:15,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-25 21:19:15,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:15,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-25 21:19:15,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294024140] [2020-10-25 21:19:15,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 21:19:15,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 21:19:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:19:15,250 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 13 states. [2020-10-25 21:19:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:15,528 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2020-10-25 21:19:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 21:19:15,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 211 [2020-10-25 21:19:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:15,535 INFO L225 Difference]: With dead ends: 1125 [2020-10-25 21:19:15,535 INFO L226 Difference]: Without dead ends: 1040 [2020-10-25 21:19:15,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:19:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-10-25 21:19:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2020-10-25 21:19:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2020-10-25 21:19:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2020-10-25 21:19:15,567 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2020-10-25 21:19:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:15,567 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2020-10-25 21:19:15,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 21:19:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2020-10-25 21:19:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-10-25 21:19:15,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:15,571 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:15,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-10-25 21:19:15,785 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2020-10-25 21:19:15,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:15,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162552063] [2020-10-25 21:19:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-25 21:19:16,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162552063] [2020-10-25 21:19:16,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292607408] [2020-10-25 21:19:16,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:16,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 21:19:16,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:16,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 21:19:16,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-25 21:19:16,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:16,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-10-25 21:19:16,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56943536] [2020-10-25 21:19:16,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 21:19:16,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 21:19:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-25 21:19:16,478 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 14 states. [2020-10-25 21:19:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:16,767 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2020-10-25 21:19:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 21:19:16,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 239 [2020-10-25 21:19:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:16,774 INFO L225 Difference]: With dead ends: 1675 [2020-10-25 21:19:16,774 INFO L226 Difference]: Without dead ends: 1121 [2020-10-25 21:19:16,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-25 21:19:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-10-25 21:19:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2020-10-25 21:19:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-10-25 21:19:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2020-10-25 21:19:16,809 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2020-10-25 21:19:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:16,810 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2020-10-25 21:19:16,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 21:19:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2020-10-25 21:19:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-10-25 21:19:16,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:16,814 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:17,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-10-25 21:19:17,027 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2020-10-25 21:19:17,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:17,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254422052] [2020-10-25 21:19:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-25 21:19:17,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254422052] [2020-10-25 21:19:17,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690980780] [2020-10-25 21:19:17,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:17,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-10-25 21:19:17,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:17,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-25 21:19:17,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-25 21:19:17,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:17,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-10-25 21:19:17,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971006177] [2020-10-25 21:19:17,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 21:19:17,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 21:19:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-10-25 21:19:17,965 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 15 states. [2020-10-25 21:19:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:18,289 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2020-10-25 21:19:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 21:19:18,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2020-10-25 21:19:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:18,296 INFO L225 Difference]: With dead ends: 1287 [2020-10-25 21:19:18,296 INFO L226 Difference]: Without dead ends: 1202 [2020-10-25 21:19:18,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-10-25 21:19:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-10-25 21:19:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2020-10-25 21:19:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2020-10-25 21:19:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2020-10-25 21:19:18,329 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2020-10-25 21:19:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:18,330 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2020-10-25 21:19:18,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 21:19:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2020-10-25 21:19:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2020-10-25 21:19:18,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:18,333 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:18,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-10-25 21:19:18,548 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2020-10-25 21:19:18,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:18,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307005821] [2020-10-25 21:19:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-10-25 21:19:18,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307005821] [2020-10-25 21:19:18,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171331013] [2020-10-25 21:19:18,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:19,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-25 21:19:19,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:19,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-25 21:19:19,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2020-10-25 21:19:19,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:19,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2020-10-25 21:19:19,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021187739] [2020-10-25 21:19:19,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-25 21:19:19,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-25 21:19:19,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2020-10-25 21:19:19,330 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2020-10-25 21:19:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:20,380 INFO L93 Difference]: Finished difference Result 1316 states and 1835 transitions. [2020-10-25 21:19:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-25 21:19:20,381 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2020-10-25 21:19:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:20,385 INFO L225 Difference]: With dead ends: 1316 [2020-10-25 21:19:20,385 INFO L226 Difference]: Without dead ends: 684 [2020-10-25 21:19:20,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=514, Invalid=1208, Unknown=0, NotChecked=0, Total=1722 [2020-10-25 21:19:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-10-25 21:19:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 659. [2020-10-25 21:19:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-25 21:19:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2020-10-25 21:19:20,405 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2020-10-25 21:19:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:20,406 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2020-10-25 21:19:20,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-25 21:19:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2020-10-25 21:19:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-10-25 21:19:20,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:20,409 INFO L422 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:19:20,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-10-25 21:19:20,623 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:20,624 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2020-10-25 21:19:20,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:20,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271546274] [2020-10-25 21:19:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:19:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-25 21:19:21,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271546274] [2020-10-25 21:19:21,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948739019] [2020-10-25 21:19:21,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:21,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 21:19:21,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 21:19:21,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-25 21:19:21,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:19:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-25 21:19:21,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 21:19:21,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2020-10-25 21:19:21,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41544515] [2020-10-25 21:19:21,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-25 21:19:21,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:19:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-25 21:19:21,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-10-25 21:19:21,830 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 19 states. [2020-10-25 21:19:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:19:22,091 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2020-10-25 21:19:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-25 21:19:22,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 349 [2020-10-25 21:19:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:19:22,097 INFO L225 Difference]: With dead ends: 865 [2020-10-25 21:19:22,097 INFO L226 Difference]: Without dead ends: 780 [2020-10-25 21:19:22,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-10-25 21:19:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-25 21:19:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2020-10-25 21:19:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2020-10-25 21:19:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2020-10-25 21:19:22,116 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2020-10-25 21:19:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:19:22,117 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2020-10-25 21:19:22,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-25 21:19:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2020-10-25 21:19:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2020-10-25 21:19:22,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:19:22,121 INFO L422 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] [2020-10-25 21:19:22,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 21:19:22,334 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:19:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:19:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2020-10-25 21:19:22,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:19:22,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695526330] [2020-10-25 21:19:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:19:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:19:23,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:19:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:19:24,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:19:24,714 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 21:19:24,714 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 21:19:24,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-25 21:19:25,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 09:19:25 BoogieIcfgContainer [2020-10-25 21:19:25,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 21:19:25,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 21:19:25,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 21:19:25,005 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 21:19:25,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:18:41" (3/4) ... [2020-10-25 21:19:25,008 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 21:19:25,317 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 21:19:25,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 21:19:25,320 INFO L168 Benchmark]: Toolchain (without parser) took 45382.46 ms. Allocated memory was 44.0 MB in the beginning and 629.1 MB in the end (delta: 585.1 MB). Free memory was 21.1 MB in the beginning and 323.8 MB in the end (delta: -302.7 MB). Peak memory consumption was 285.5 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,321 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 44.0 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 52.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:19:25,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.06 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 29.5 MB in the beginning and 33.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.20 ms. Allocated memory is still 54.5 MB. Free memory was 33.3 MB in the beginning and 28.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,322 INFO L168 Benchmark]: Boogie Preprocessor took 112.94 ms. Allocated memory is still 54.5 MB. Free memory was 28.6 MB in the beginning and 25.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,324 INFO L168 Benchmark]: RCFGBuilder took 1122.72 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 25.5 MB in the beginning and 41.8 MB in the end (delta: -16.3 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,325 INFO L168 Benchmark]: TraceAbstraction took 43102.94 ms. Allocated memory was 67.1 MB in the beginning and 629.1 MB in the end (delta: 562.0 MB). Free memory was 41.3 MB in the beginning and 369.9 MB in the end (delta: -328.6 MB). Peak memory consumption was 371.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,325 INFO L168 Benchmark]: Witness Printer took 312.93 ms. Allocated memory is still 629.1 MB. Free memory was 369.9 MB in the beginning and 323.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:19:25,327 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.28 ms. Allocated memory is still 44.0 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 52.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 550.06 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 29.5 MB in the beginning and 33.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 133.20 ms. Allocated memory is still 54.5 MB. Free memory was 33.3 MB in the beginning and 28.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 112.94 ms. Allocated memory is still 54.5 MB. Free memory was 28.6 MB in the beginning and 25.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1122.72 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 25.5 MB in the beginning and 41.8 MB in the end (delta: -16.3 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43102.94 ms. Allocated memory was 67.1 MB in the beginning and 629.1 MB in the end (delta: 562.0 MB). Free memory was 41.3 MB in the beginning and 369.9 MB in the end (delta: -328.6 MB). Peak memory consumption was 371.1 MB. Max. memory is 16.1 GB. * Witness Printer took 312.93 ms. Allocated memory is still 629.1 MB. Free memory was 369.9 MB in the beginning and 323.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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] [L4] __assert_fail("0", "psyco_abp_1-1.c", 4, "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, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.7s, OverallIterations: 40, TraceHistogramMax: 35, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8314 SDtfs, 12703 SDslu, 44187 SDs, 0 SdLazy, 6960 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4454 GetRequests, 4039 SyntacticMatches, 28 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 385 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 5984920 SizeOfPredicates, 61 NumberOfNonLiveVariables, 22562 ConjunctsInSsa, 623 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 9026/31839 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! Received shutdown request...