./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer --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-a4ecdab [2020-11-29 19:37:06,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:37:06,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:37:06,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:37:06,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:37:06,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:37:06,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:37:06,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:37:06,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:37:06,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:37:06,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:37:06,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:37:06,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:37:06,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:37:06,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:37:06,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:37:06,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:37:06,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:37:06,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:37:06,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:37:06,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:37:06,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:37:06,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:37:06,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:37:06,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:37:06,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:37:06,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:37:06,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:37:06,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:37:06,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:37:06,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:37:06,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:37:06,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:37:06,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:37:06,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:37:06,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:37:06,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:37:06,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:37:06,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:37:06,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:37:06,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:37:06,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:37:06,971 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:37:06,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:37:06,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:37:06,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:37:06,974 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:37:06,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:37:06,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:37:06,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:37:06,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:37:06,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:37:06,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:37:06,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:37:06,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:37:06,976 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:37:06,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:37:06,977 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:37:06,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:37:06,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:37:06,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:37:06,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:37:06,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:37:06,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:37:06,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:37:06,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:37:06,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:37:06,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:37:06,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:37:06,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:37:06,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:37:06,981 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:/tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer 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-11-29 19:37:07,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:37:07,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:37:07,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:37:07,370 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:37:07,373 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:37:07,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-11-29 19:37:07,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/data/d36cac379/8fd34ac86b084cea91d04aa066a95102/FLAG0f5505c83 [2020-11-29 19:37:08,119 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:37:08,120 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-11-29 19:37:08,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/data/d36cac379/8fd34ac86b084cea91d04aa066a95102/FLAG0f5505c83 [2020-11-29 19:37:08,387 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/data/d36cac379/8fd34ac86b084cea91d04aa066a95102 [2020-11-29 19:37:08,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:37:08,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:37:08,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:37:08,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:37:08,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:37:08,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:37:08" (1/1) ... [2020-11-29 19:37:08,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf73c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:08, skipping insertion in model container [2020-11-29 19:37:08,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:37:08" (1/1) ... [2020-11-29 19:37:08,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:37:08,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:37:08,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:37:08,927 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:37:09,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:37:09,048 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:37:09,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09 WrapperNode [2020-11-29 19:37:09,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:37:09,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:37:09,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:37:09,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:37:09,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:37:09,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:37:09,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:37:09,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:37:09,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... [2020-11-29 19:37:09,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:37:09,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:37:09,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:37:09,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:37:09,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:37:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:37:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:37:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:37:10,812 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:37:10,813 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-29 19:37:10,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:37:10 BoogieIcfgContainer [2020-11-29 19:37:10,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:37:10,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:37:10,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:37:10,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:37:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:37:08" (1/3) ... [2020-11-29 19:37:10,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a34b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:37:10, skipping insertion in model container [2020-11-29 19:37:10,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:37:09" (2/3) ... [2020-11-29 19:37:10,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a34b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:37:10, skipping insertion in model container [2020-11-29 19:37:10,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:37:10" (3/3) ... [2020-11-29 19:37:10,830 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2020-11-29 19:37:10,843 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:37:10,848 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 19:37:10,859 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 19:37:10,886 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:37:10,887 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:37:10,887 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:37:10,887 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:37:10,887 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:37:10,888 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:37:10,888 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:37:10,888 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:37:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-11-29 19:37:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 19:37:10,914 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:10,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:10,915 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2020-11-29 19:37:10,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:10,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15062773] [2020-11-29 19:37:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:11,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15062773] [2020-11-29 19:37:11,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:11,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:37:11,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467209983] [2020-11-29 19:37:11,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 19:37:11,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 19:37:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:37:11,138 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2020-11-29 19:37:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:11,173 INFO L93 Difference]: Finished difference Result 219 states and 421 transitions. [2020-11-29 19:37:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 19:37:11,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-11-29 19:37:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:11,191 INFO L225 Difference]: With dead ends: 219 [2020-11-29 19:37:11,191 INFO L226 Difference]: Without dead ends: 106 [2020-11-29 19:37:11,198 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-11-29 19:37:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-29 19:37:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-29 19:37:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-29 19:37:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2020-11-29 19:37:11,280 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2020-11-29 19:37:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:11,281 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2020-11-29 19:37:11,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 19:37:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2020-11-29 19:37:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:37:11,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:11,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:11,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:37:11,287 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2020-11-29 19:37:11,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:11,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670105497] [2020-11-29 19:37:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:11,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670105497] [2020-11-29 19:37:11,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:11,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:11,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650418091] [2020-11-29 19:37:11,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:11,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:11,417 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2020-11-29 19:37:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:11,519 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2020-11-29 19:37:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:11,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-29 19:37:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:11,522 INFO L225 Difference]: With dead ends: 214 [2020-11-29 19:37:11,523 INFO L226 Difference]: Without dead ends: 110 [2020-11-29 19:37:11,524 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-11-29 19:37:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-29 19:37:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-29 19:37:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-29 19:37:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2020-11-29 19:37:11,541 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2020-11-29 19:37:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:11,542 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2020-11-29 19:37:11,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2020-11-29 19:37:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 19:37:11,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:11,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:11,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:37:11,545 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2020-11-29 19:37:11,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:11,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201618996] [2020-11-29 19:37:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:11,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201618996] [2020-11-29 19:37:11,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:11,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:11,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953669508] [2020-11-29 19:37:11,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:11,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:11,788 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2020-11-29 19:37:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:12,042 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2020-11-29 19:37:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:12,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-29 19:37:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:12,046 INFO L225 Difference]: With dead ends: 324 [2020-11-29 19:37:12,046 INFO L226 Difference]: Without dead ends: 195 [2020-11-29 19:37:12,047 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-11-29 19:37:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-11-29 19:37:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2020-11-29 19:37:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-29 19:37:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2020-11-29 19:37:12,064 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2020-11-29 19:37:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:12,064 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2020-11-29 19:37:12,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2020-11-29 19:37:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 19:37:12,066 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:12,066 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:12,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:37:12,066 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2020-11-29 19:37:12,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:12,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493460522] [2020-11-29 19:37:12,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:12,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493460522] [2020-11-29 19:37:12,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:12,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:12,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793709532] [2020-11-29 19:37:12,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:12,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:12,162 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2020-11-29 19:37:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:12,228 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2020-11-29 19:37:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:12,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-29 19:37:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:12,230 INFO L225 Difference]: With dead ends: 314 [2020-11-29 19:37:12,231 INFO L226 Difference]: Without dead ends: 133 [2020-11-29 19:37:12,232 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-11-29 19:37:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-11-29 19:37:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-11-29 19:37:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-11-29 19:37:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2020-11-29 19:37:12,251 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2020-11-29 19:37:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:12,252 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2020-11-29 19:37:12,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2020-11-29 19:37:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 19:37:12,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:12,261 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:37:12,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:37:12,261 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2020-11-29 19:37:12,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:12,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48576776] [2020-11-29 19:37:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 19:37:12,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48576776] [2020-11-29 19:37:12,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:12,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:12,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35894948] [2020-11-29 19:37:12,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:12,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:12,371 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2020-11-29 19:37:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:12,441 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2020-11-29 19:37:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:12,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-29 19:37:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:12,443 INFO L225 Difference]: With dead ends: 243 [2020-11-29 19:37:12,444 INFO L226 Difference]: Without dead ends: 115 [2020-11-29 19:37:12,445 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-11-29 19:37:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-29 19:37:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2020-11-29 19:37:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-29 19:37:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2020-11-29 19:37:12,463 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2020-11-29 19:37:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:12,463 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2020-11-29 19:37:12,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2020-11-29 19:37:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 19:37:12,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:12,467 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-11-29 19:37:12,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:37:12,468 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2020-11-29 19:37:12,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:12,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478695981] [2020-11-29 19:37:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:12,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478695981] [2020-11-29 19:37:12,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690270390] [2020-11-29 19:37:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:12,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 19:37:12,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:12,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:12,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:37:12,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042198931] [2020-11-29 19:37:12,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:37:12,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:37:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:37:12,813 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2020-11-29 19:37:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:13,068 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2020-11-29 19:37:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:37:13,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-11-29 19:37:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:13,071 INFO L225 Difference]: With dead ends: 204 [2020-11-29 19:37:13,071 INFO L226 Difference]: Without dead ends: 192 [2020-11-29 19:37:13,072 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-11-29 19:37:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-29 19:37:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2020-11-29 19:37:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-11-29 19:37:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2020-11-29 19:37:13,092 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2020-11-29 19:37:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:13,093 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2020-11-29 19:37:13,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:37:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2020-11-29 19:37:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 19:37:13,096 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:13,098 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-11-29 19:37:13,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-29 19:37:13,329 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2020-11-29 19:37:13,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:13,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349452612] [2020-11-29 19:37:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:13,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349452612] [2020-11-29 19:37:13,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630647603] [2020-11-29 19:37:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:13,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:37:13,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:13,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:13,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 19:37:13,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720963958] [2020-11-29 19:37:13,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:37:13,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:37:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:37:13,614 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2020-11-29 19:37:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:13,768 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2020-11-29 19:37:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:37:13,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-29 19:37:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:13,770 INFO L225 Difference]: With dead ends: 387 [2020-11-29 19:37:13,771 INFO L226 Difference]: Without dead ends: 230 [2020-11-29 19:37:13,771 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-11-29 19:37:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-11-29 19:37:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2020-11-29 19:37:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-11-29 19:37:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2020-11-29 19:37:13,781 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2020-11-29 19:37:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:13,781 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2020-11-29 19:37:13,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:37:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2020-11-29 19:37:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 19:37:13,782 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:13,783 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-11-29 19:37:14,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:14,009 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2020-11-29 19:37:14,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:14,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843592641] [2020-11-29 19:37:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 19:37:14,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843592641] [2020-11-29 19:37:14,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:14,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:14,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499903369] [2020-11-29 19:37:14,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:14,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:14,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:14,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:14,067 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2020-11-29 19:37:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:14,118 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2020-11-29 19:37:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:14,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-29 19:37:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:14,121 INFO L225 Difference]: With dead ends: 409 [2020-11-29 19:37:14,122 INFO L226 Difference]: Without dead ends: 211 [2020-11-29 19:37:14,122 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-11-29 19:37:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-29 19:37:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-11-29 19:37:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-11-29 19:37:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2020-11-29 19:37:14,145 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2020-11-29 19:37:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:14,147 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2020-11-29 19:37:14,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2020-11-29 19:37:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 19:37:14,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:14,151 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-11-29 19:37:14,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:37:14,152 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2020-11-29 19:37:14,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:14,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672980508] [2020-11-29 19:37:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:14,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672980508] [2020-11-29 19:37:14,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:14,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:14,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070540357] [2020-11-29 19:37:14,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:14,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:14,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:14,226 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2020-11-29 19:37:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:14,274 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2020-11-29 19:37:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:14,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-29 19:37:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:14,278 INFO L225 Difference]: With dead ends: 375 [2020-11-29 19:37:14,278 INFO L226 Difference]: Without dead ends: 211 [2020-11-29 19:37:14,279 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-11-29 19:37:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-29 19:37:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-11-29 19:37:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-11-29 19:37:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2020-11-29 19:37:14,291 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2020-11-29 19:37:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:14,292 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2020-11-29 19:37:14,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2020-11-29 19:37:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 19:37:14,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:14,294 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-11-29 19:37:14,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:37:14,294 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2020-11-29 19:37:14,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:14,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918036808] [2020-11-29 19:37:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:14,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918036808] [2020-11-29 19:37:14,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549479062] [2020-11-29 19:37:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:14,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:37:14,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 19:37:14,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:14,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-11-29 19:37:14,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263719116] [2020-11-29 19:37:14,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:37:14,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:37:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:37:14,744 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 7 states. [2020-11-29 19:37:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:15,326 INFO L93 Difference]: Finished difference Result 490 states and 766 transitions. [2020-11-29 19:37:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:37:15,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-11-29 19:37:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:15,329 INFO L225 Difference]: With dead ends: 490 [2020-11-29 19:37:15,329 INFO L226 Difference]: Without dead ends: 275 [2020-11-29 19:37:15,330 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-11-29 19:37:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-11-29 19:37:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2020-11-29 19:37:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-11-29 19:37:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2020-11-29 19:37:15,339 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2020-11-29 19:37:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:15,340 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2020-11-29 19:37:15,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:37:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2020-11-29 19:37:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-29 19:37:15,341 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:15,341 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-11-29 19:37:15,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-29 19:37:15,550 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2020-11-29 19:37:15,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:15,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709101807] [2020-11-29 19:37:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:37:15,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709101807] [2020-11-29 19:37:15,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689231550] [2020-11-29 19:37:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:15,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 19:37:15,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:37:15,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:15,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-11-29 19:37:15,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395454250] [2020-11-29 19:37:15,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:37:15,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:37:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:37:15,780 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2020-11-29 19:37:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:15,946 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2020-11-29 19:37:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:37:15,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-29 19:37:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:15,949 INFO L225 Difference]: With dead ends: 274 [2020-11-29 19:37:15,950 INFO L226 Difference]: Without dead ends: 262 [2020-11-29 19:37:15,950 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-11-29 19:37:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-29 19:37:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-11-29 19:37:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-11-29 19:37:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2020-11-29 19:37:15,961 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2020-11-29 19:37:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:15,962 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2020-11-29 19:37:15,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:37:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2020-11-29 19:37:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 19:37:15,963 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:15,963 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-11-29 19:37:16,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:16,164 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2020-11-29 19:37:16,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:16,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247444828] [2020-11-29 19:37:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:16,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247444828] [2020-11-29 19:37:16,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99604050] [2020-11-29 19:37:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:16,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 19:37:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:16,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:16,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 19:37:16,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040270693] [2020-11-29 19:37:16,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:37:16,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:37:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:37:16,685 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2020-11-29 19:37:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:16,911 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2020-11-29 19:37:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:37:16,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-11-29 19:37:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:16,914 INFO L225 Difference]: With dead ends: 271 [2020-11-29 19:37:16,914 INFO L226 Difference]: Without dead ends: 269 [2020-11-29 19:37:16,915 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-11-29 19:37:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-11-29 19:37:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2020-11-29 19:37:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-11-29 19:37:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2020-11-29 19:37:16,934 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2020-11-29 19:37:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:16,936 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2020-11-29 19:37:16,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:37:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2020-11-29 19:37:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-29 19:37:16,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:16,938 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-11-29 19:37:17,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-29 19:37:17,152 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2020-11-29 19:37:17,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:17,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983279042] [2020-11-29 19:37:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:17,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983279042] [2020-11-29 19:37:17,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:17,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:17,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452566683] [2020-11-29 19:37:17,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:17,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:17,189 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2020-11-29 19:37:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:17,229 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2020-11-29 19:37:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:17,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-11-29 19:37:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:17,231 INFO L225 Difference]: With dead ends: 461 [2020-11-29 19:37:17,232 INFO L226 Difference]: Without dead ends: 245 [2020-11-29 19:37:17,232 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-11-29 19:37:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-29 19:37:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2020-11-29 19:37:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-29 19:37:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2020-11-29 19:37:17,242 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2020-11-29 19:37:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:17,243 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2020-11-29 19:37:17,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2020-11-29 19:37:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:37:17,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:17,244 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-11-29 19:37:17,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 19:37:17,244 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2020-11-29 19:37:17,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:17,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830421697] [2020-11-29 19:37:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-29 19:37:17,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830421697] [2020-11-29 19:37:17,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:37:17,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:37:17,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069428685] [2020-11-29 19:37:17,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:37:17,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:37:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:37:17,304 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2020-11-29 19:37:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:17,364 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2020-11-29 19:37:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:37:17,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-29 19:37:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:17,367 INFO L225 Difference]: With dead ends: 333 [2020-11-29 19:37:17,367 INFO L226 Difference]: Without dead ends: 155 [2020-11-29 19:37:17,368 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-11-29 19:37:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-29 19:37:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-11-29 19:37:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-11-29 19:37:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2020-11-29 19:37:17,377 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2020-11-29 19:37:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:17,378 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2020-11-29 19:37:17,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:37:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2020-11-29 19:37:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 19:37:17,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:17,379 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-11-29 19:37:17,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 19:37:17,380 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2020-11-29 19:37:17,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:17,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227752895] [2020-11-29 19:37:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 19:37:17,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227752895] [2020-11-29 19:37:17,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833414633] [2020-11-29 19:37:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:17,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:37:17,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 19:37:17,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:17,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-11-29 19:37:17,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989798017] [2020-11-29 19:37:17,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:37:17,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:37:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:37:17,674 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2020-11-29 19:37:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:17,800 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2020-11-29 19:37:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:37:17,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-11-29 19:37:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:17,802 INFO L225 Difference]: With dead ends: 286 [2020-11-29 19:37:17,802 INFO L226 Difference]: Without dead ends: 194 [2020-11-29 19:37:17,803 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-11-29 19:37:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-29 19:37:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2020-11-29 19:37:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-29 19:37:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2020-11-29 19:37:17,817 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2020-11-29 19:37:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:17,818 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2020-11-29 19:37:17,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:37:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2020-11-29 19:37:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 19:37:17,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:17,819 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-11-29 19:37:18,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:18,033 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2020-11-29 19:37:18,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:18,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391040188] [2020-11-29 19:37:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:18,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391040188] [2020-11-29 19:37:18,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990477865] [2020-11-29 19:37:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:18,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 19:37:18,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:18,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:18,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 19:37:18,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776244726] [2020-11-29 19:37:18,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:37:18,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:37:18,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:37:18,401 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 7 states. [2020-11-29 19:37:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:18,533 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2020-11-29 19:37:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:37:18,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-11-29 19:37:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:18,536 INFO L225 Difference]: With dead ends: 193 [2020-11-29 19:37:18,536 INFO L226 Difference]: Without dead ends: 191 [2020-11-29 19:37:18,536 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-11-29 19:37:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-11-29 19:37:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-11-29 19:37:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-29 19:37:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2020-11-29 19:37:18,544 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2020-11-29 19:37:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:18,545 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2020-11-29 19:37:18,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:37:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2020-11-29 19:37:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 19:37:18,546 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:18,546 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-11-29 19:37:18,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-29 19:37:18,761 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2020-11-29 19:37:18,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:18,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506760750] [2020-11-29 19:37:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:19,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506760750] [2020-11-29 19:37:19,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945140978] [2020-11-29 19:37:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 19:37:19,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:19,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:19,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 19:37:19,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129525104] [2020-11-29 19:37:19,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:37:19,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:37:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:37:19,265 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 8 states. [2020-11-29 19:37:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:19,444 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2020-11-29 19:37:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:37:19,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-29 19:37:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:19,448 INFO L225 Difference]: With dead ends: 196 [2020-11-29 19:37:19,448 INFO L226 Difference]: Without dead ends: 194 [2020-11-29 19:37:19,448 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-11-29 19:37:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-29 19:37:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-11-29 19:37:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-29 19:37:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2020-11-29 19:37:19,475 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2020-11-29 19:37:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:19,476 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2020-11-29 19:37:19,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:37:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2020-11-29 19:37:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-29 19:37:19,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:19,478 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-11-29 19:37:19,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-29 19:37:19,705 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2020-11-29 19:37:19,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:19,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584512921] [2020-11-29 19:37:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:19,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584512921] [2020-11-29 19:37:19,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496998005] [2020-11-29 19:37:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:20,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 19:37:20,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:20,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:20,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-11-29 19:37:20,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604156579] [2020-11-29 19:37:20,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:20,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:20,280 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 12 states. [2020-11-29 19:37:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:20,574 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2020-11-29 19:37:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:37:20,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-29 19:37:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:20,576 INFO L225 Difference]: With dead ends: 301 [2020-11-29 19:37:20,577 INFO L226 Difference]: Without dead ends: 211 [2020-11-29 19:37:20,577 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-11-29 19:37:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-29 19:37:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-11-29 19:37:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-29 19:37:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2020-11-29 19:37:20,586 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2020-11-29 19:37:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:20,587 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-11-29 19:37:20,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2020-11-29 19:37:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-29 19:37:20,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:20,594 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-11-29 19:37:20,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-11-29 19:37:20,809 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2020-11-29 19:37:20,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:20,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073184964] [2020-11-29 19:37:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:21,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073184964] [2020-11-29 19:37:21,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241699053] [2020-11-29 19:37:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:21,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-29 19:37:21,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-29 19:37:21,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:21,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-11-29 19:37:21,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020175808] [2020-11-29 19:37:21,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:37:21,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:37:21,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:37:21,405 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 9 states. [2020-11-29 19:37:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:21,712 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2020-11-29 19:37:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:37:21,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2020-11-29 19:37:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:21,715 INFO L225 Difference]: With dead ends: 329 [2020-11-29 19:37:21,715 INFO L226 Difference]: Without dead ends: 239 [2020-11-29 19:37:21,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-29 19:37:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2020-11-29 19:37:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-29 19:37:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2020-11-29 19:37:21,727 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2020-11-29 19:37:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:21,728 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2020-11-29 19:37:21,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:37:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2020-11-29 19:37:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-29 19:37:21,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:21,729 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-11-29 19:37:21,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:21,930 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2020-11-29 19:37:21,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:21,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904841220] [2020-11-29 19:37:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:22,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904841220] [2020-11-29 19:37:22,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486888448] [2020-11-29 19:37:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:22,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-29 19:37:22,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:22,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:22,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-11-29 19:37:22,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457536080] [2020-11-29 19:37:22,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:37:22,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:37:22,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:22,610 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 13 states. [2020-11-29 19:37:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:23,032 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2020-11-29 19:37:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:37:23,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2020-11-29 19:37:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:23,035 INFO L225 Difference]: With dead ends: 233 [2020-11-29 19:37:23,035 INFO L226 Difference]: Without dead ends: 231 [2020-11-29 19:37:23,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-11-29 19:37:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-11-29 19:37:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-11-29 19:37:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2020-11-29 19:37:23,047 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2020-11-29 19:37:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:23,048 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2020-11-29 19:37:23,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:37:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2020-11-29 19:37:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-29 19:37:23,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:23,050 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-11-29 19:37:23,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:23,265 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2020-11-29 19:37:23,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:23,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243829993] [2020-11-29 19:37:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-29 19:37:23,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243829993] [2020-11-29 19:37:23,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117316788] [2020-11-29 19:37:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-29 19:37:23,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-29 19:37:23,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:23,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-29 19:37:23,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111094929] [2020-11-29 19:37:23,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:37:23,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:37:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:37:23,760 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2020-11-29 19:37:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:23,999 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2020-11-29 19:37:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:37:24,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2020-11-29 19:37:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:24,002 INFO L225 Difference]: With dead ends: 364 [2020-11-29 19:37:24,002 INFO L226 Difference]: Without dead ends: 272 [2020-11-29 19:37:24,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:37:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-29 19:37:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-11-29 19:37:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-11-29 19:37:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2020-11-29 19:37:24,018 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2020-11-29 19:37:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:24,018 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2020-11-29 19:37:24,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:37:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2020-11-29 19:37:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-29 19:37:24,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:24,020 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-11-29 19:37:24,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:24,234 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2020-11-29 19:37:24,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:24,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323846440] [2020-11-29 19:37:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:24,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323846440] [2020-11-29 19:37:24,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417644490] [2020-11-29 19:37:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:24,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-29 19:37:24,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:24,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:24,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-11-29 19:37:24,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522465496] [2020-11-29 19:37:24,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:24,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:24,936 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 14 states. [2020-11-29 19:37:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:25,297 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2020-11-29 19:37:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:25,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-11-29 19:37:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:25,301 INFO L225 Difference]: With dead ends: 271 [2020-11-29 19:37:25,302 INFO L226 Difference]: Without dead ends: 269 [2020-11-29 19:37:25,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:37:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-11-29 19:37:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-11-29 19:37:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-11-29 19:37:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2020-11-29 19:37:25,312 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2020-11-29 19:37:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:25,313 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2020-11-29 19:37:25,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:37:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2020-11-29 19:37:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-29 19:37:25,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:25,315 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-11-29 19:37:25,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-11-29 19:37:25,529 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2020-11-29 19:37:25,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:25,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906296790] [2020-11-29 19:37:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:37:26,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906296790] [2020-11-29 19:37:26,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164153755] [2020-11-29 19:37:26,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:26,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:26,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:26,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-29 19:37:26,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:26,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:26,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2020-11-29 19:37:26,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637649165] [2020-11-29 19:37:26,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:37:26,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:37:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:37:26,452 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 16 states. [2020-11-29 19:37:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:26,953 INFO L93 Difference]: Finished difference Result 274 states and 383 transitions. [2020-11-29 19:37:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:37:26,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-11-29 19:37:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:26,957 INFO L225 Difference]: With dead ends: 274 [2020-11-29 19:37:26,957 INFO L226 Difference]: Without dead ends: 272 [2020-11-29 19:37:26,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-11-29 19:37:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-29 19:37:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2020-11-29 19:37:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-11-29 19:37:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2020-11-29 19:37:26,972 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2020-11-29 19:37:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:26,972 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2020-11-29 19:37:26,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:37:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2020-11-29 19:37:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-29 19:37:26,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:26,974 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-11-29 19:37:27,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:27,192 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2020-11-29 19:37:27,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:27,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828193384] [2020-11-29 19:37:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:37:27,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828193384] [2020-11-29 19:37:27,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193141308] [2020-11-29 19:37:27,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:27,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:27,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:27,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-29 19:37:27,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:27,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:27,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2020-11-29 19:37:27,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838418652] [2020-11-29 19:37:27,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-29 19:37:27,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-29 19:37:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-11-29 19:37:27,968 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 18 states. [2020-11-29 19:37:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:28,372 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2020-11-29 19:37:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:37:28,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 119 [2020-11-29 19:37:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:28,375 INFO L225 Difference]: With dead ends: 379 [2020-11-29 19:37:28,375 INFO L226 Difference]: Without dead ends: 289 [2020-11-29 19:37:28,375 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-11-29 19:37:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-29 19:37:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2020-11-29 19:37:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-11-29 19:37:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2020-11-29 19:37:28,387 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2020-11-29 19:37:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:28,387 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2020-11-29 19:37:28,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-29 19:37:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2020-11-29 19:37:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-29 19:37:28,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:28,390 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-11-29 19:37:28,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-29 19:37:28,603 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2020-11-29 19:37:28,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:28,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255813335] [2020-11-29 19:37:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 304 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:37:29,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255813335] [2020-11-29 19:37:29,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098487779] [2020-11-29 19:37:29,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:29,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:29,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:29,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-29 19:37:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 19:37:29,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:29,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-11-29 19:37:29,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565700467] [2020-11-29 19:37:29,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:37:29,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:37:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:29,378 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 11 states. [2020-11-29 19:37:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:29,849 INFO L93 Difference]: Finished difference Result 408 states and 578 transitions. [2020-11-29 19:37:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:37:29,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2020-11-29 19:37:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:29,852 INFO L225 Difference]: With dead ends: 408 [2020-11-29 19:37:29,853 INFO L226 Difference]: Without dead ends: 318 [2020-11-29 19:37:29,853 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-11-29 19:37:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-11-29 19:37:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2020-11-29 19:37:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-11-29 19:37:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2020-11-29 19:37:29,866 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2020-11-29 19:37:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:29,866 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2020-11-29 19:37:29,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:37:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2020-11-29 19:37:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-29 19:37:29,869 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:29,869 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-11-29 19:37:30,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:30,085 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2020-11-29 19:37:30,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:30,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353819781] [2020-11-29 19:37:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:37:30,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353819781] [2020-11-29 19:37:30,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367177959] [2020-11-29 19:37:30,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:30,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:30,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:30,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-29 19:37:30,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:31,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:31,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2020-11-29 19:37:31,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814614392] [2020-11-29 19:37:31,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 19:37:31,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 19:37:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:37:31,193 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 19 states. [2020-11-29 19:37:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:31,554 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2020-11-29 19:37:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:37:31,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 132 [2020-11-29 19:37:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:31,557 INFO L225 Difference]: With dead ends: 311 [2020-11-29 19:37:31,558 INFO L226 Difference]: Without dead ends: 309 [2020-11-29 19:37:31,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:37:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-11-29 19:37:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2020-11-29 19:37:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-11-29 19:37:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2020-11-29 19:37:31,574 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2020-11-29 19:37:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:31,574 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2020-11-29 19:37:31,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 19:37:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2020-11-29 19:37:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-29 19:37:31,577 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:31,577 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-11-29 19:37:31,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-29 19:37:31,805 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2020-11-29 19:37:31,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:31,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010325314] [2020-11-29 19:37:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 19:37:32,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010325314] [2020-11-29 19:37:32,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825938633] [2020-11-29 19:37:32,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:32,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:32,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:32,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 26 conjunts are in the unsatisfiable core [2020-11-29 19:37:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 19:37:32,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:32,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-11-29 19:37:32,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067924579] [2020-11-29 19:37:32,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:37:32,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:37:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:37:32,420 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2020-11-29 19:37:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:32,749 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2020-11-29 19:37:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:37:32,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2020-11-29 19:37:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:32,752 INFO L225 Difference]: With dead ends: 442 [2020-11-29 19:37:32,753 INFO L226 Difference]: Without dead ends: 350 [2020-11-29 19:37:32,753 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-11-29 19:37:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-11-29 19:37:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2020-11-29 19:37:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-11-29 19:37:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2020-11-29 19:37:32,770 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2020-11-29 19:37:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:32,770 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2020-11-29 19:37:32,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:37:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2020-11-29 19:37:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-29 19:37:32,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:32,773 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-11-29 19:37:33,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-11-29 19:37:33,001 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:33,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:33,002 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2020-11-29 19:37:33,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:33,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686985649] [2020-11-29 19:37:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:37:33,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686985649] [2020-11-29 19:37:33,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936833645] [2020-11-29 19:37:33,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:33,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:33,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:33,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-29 19:37:33,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:37:33,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:33,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2020-11-29 19:37:33,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434569593] [2020-11-29 19:37:33,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-29 19:37:33,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 19:37:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:37:33,937 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 20 states. [2020-11-29 19:37:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:34,575 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2020-11-29 19:37:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 19:37:34,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 148 [2020-11-29 19:37:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:34,577 INFO L225 Difference]: With dead ends: 349 [2020-11-29 19:37:34,577 INFO L226 Difference]: Without dead ends: 347 [2020-11-29 19:37:34,578 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-11-29 19:37:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-11-29 19:37:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2020-11-29 19:37:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-11-29 19:37:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2020-11-29 19:37:34,592 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2020-11-29 19:37:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:34,592 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2020-11-29 19:37:34,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-29 19:37:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2020-11-29 19:37:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-11-29 19:37:34,595 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:34,595 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-11-29 19:37:34,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-11-29 19:37:34,813 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2020-11-29 19:37:34,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:34,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804339359] [2020-11-29 19:37:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 454 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 19:37:35,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804339359] [2020-11-29 19:37:35,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453233358] [2020-11-29 19:37:35,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:35,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-11-29 19:37:35,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:35,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 19:37:35,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 248 proven. 32 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-11-29 19:37:35,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:35,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-11-29 19:37:35,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364505947] [2020-11-29 19:37:35,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 19:37:35,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 19:37:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-11-29 19:37:35,922 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 16 states. [2020-11-29 19:37:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:37,595 INFO L93 Difference]: Finished difference Result 544 states and 765 transitions. [2020-11-29 19:37:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-29 19:37:37,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 155 [2020-11-29 19:37:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:37,600 INFO L225 Difference]: With dead ends: 544 [2020-11-29 19:37:37,600 INFO L226 Difference]: Without dead ends: 448 [2020-11-29 19:37:37,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2020-11-29 19:37:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-11-29 19:37:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2020-11-29 19:37:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-11-29 19:37:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2020-11-29 19:37:37,620 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2020-11-29 19:37:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:37,621 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2020-11-29 19:37:37,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 19:37:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2020-11-29 19:37:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-29 19:37:37,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:37,624 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-11-29 19:37:37,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-29 19:37:37,824 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2020-11-29 19:37:37,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:37,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431769727] [2020-11-29 19:37:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:38,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431769727] [2020-11-29 19:37:38,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513282488] [2020-11-29 19:37:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:38,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:37:38,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:38,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:38,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 19:37:38,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888973239] [2020-11-29 19:37:38,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 19:37:38,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 19:37:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:38,418 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 11 states. [2020-11-29 19:37:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:38,676 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2020-11-29 19:37:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 19:37:38,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2020-11-29 19:37:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:38,682 INFO L225 Difference]: With dead ends: 927 [2020-11-29 19:37:38,682 INFO L226 Difference]: Without dead ends: 760 [2020-11-29 19:37:38,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:37:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-11-29 19:37:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2020-11-29 19:37:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-11-29 19:37:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2020-11-29 19:37:38,708 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2020-11-29 19:37:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:38,709 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2020-11-29 19:37:38,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 19:37:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2020-11-29 19:37:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 19:37:38,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:38,712 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-11-29 19:37:38,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:38,937 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:38,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2020-11-29 19:37:38,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:38,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484496534] [2020-11-29 19:37:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 526 proven. 136 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:39,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484496534] [2020-11-29 19:37:39,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687844232] [2020-11-29 19:37:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:39,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 19:37:39,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-29 19:37:39,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 19:37:39,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2020-11-29 19:37:39,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733266730] [2020-11-29 19:37:39,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:37:39,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:37:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:39,737 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2020-11-29 19:37:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:39,945 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2020-11-29 19:37:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 19:37:39,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-11-29 19:37:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:39,952 INFO L225 Difference]: With dead ends: 860 [2020-11-29 19:37:39,952 INFO L226 Difference]: Without dead ends: 856 [2020-11-29 19:37:39,953 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-11-29 19:37:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2020-11-29 19:37:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2020-11-29 19:37:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-29 19:37:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2020-11-29 19:37:39,979 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2020-11-29 19:37:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:39,980 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2020-11-29 19:37:39,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:37:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2020-11-29 19:37:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 19:37:39,983 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:39,983 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-11-29 19:37:40,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:40,197 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2020-11-29 19:37:40,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:40,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97430369] [2020-11-29 19:37:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:40,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97430369] [2020-11-29 19:37:40,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646495607] [2020-11-29 19:37:40,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:41,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-11-29 19:37:41,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:41,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-29 19:37:41,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:41,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:41,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-11-29 19:37:41,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381929958] [2020-11-29 19:37:41,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-29 19:37:41,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-29 19:37:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-11-29 19:37:41,590 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 22 states. [2020-11-29 19:37:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:42,199 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2020-11-29 19:37:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 19:37:42,200 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2020-11-29 19:37:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:42,206 INFO L225 Difference]: With dead ends: 863 [2020-11-29 19:37:42,207 INFO L226 Difference]: Without dead ends: 861 [2020-11-29 19:37:42,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2020-11-29 19:37:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-11-29 19:37:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2020-11-29 19:37:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-29 19:37:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2020-11-29 19:37:42,242 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2020-11-29 19:37:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:42,243 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2020-11-29 19:37:42,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-29 19:37:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2020-11-29 19:37:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-29 19:37:42,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:42,247 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-11-29 19:37:42,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-11-29 19:37:42,473 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:42,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2020-11-29 19:37:42,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:42,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208816766] [2020-11-29 19:37:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-29 19:37:42,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208816766] [2020-11-29 19:37:42,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67063943] [2020-11-29 19:37:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:42,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:37:42,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-29 19:37:43,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:43,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 19:37:43,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155507546] [2020-11-29 19:37:43,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 19:37:43,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:37:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:43,080 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 12 states. [2020-11-29 19:37:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:43,387 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2020-11-29 19:37:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 19:37:43,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2020-11-29 19:37:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:43,394 INFO L225 Difference]: With dead ends: 1435 [2020-11-29 19:37:43,394 INFO L226 Difference]: Without dead ends: 959 [2020-11-29 19:37:43,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:37:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-11-29 19:37:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2020-11-29 19:37:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-11-29 19:37:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2020-11-29 19:37:43,433 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2020-11-29 19:37:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:43,433 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2020-11-29 19:37:43,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 19:37:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2020-11-29 19:37:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-29 19:37:43,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:43,436 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-11-29 19:37:43,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:43,649 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2020-11-29 19:37:43,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:43,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324785209] [2020-11-29 19:37:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:44,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324785209] [2020-11-29 19:37:44,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765909526] [2020-11-29 19:37:44,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:44,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-11-29 19:37:44,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:44,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-29 19:37:44,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:37:44,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:44,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-11-29 19:37:44,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956751750] [2020-11-29 19:37:44,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-29 19:37:44,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-29 19:37:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-11-29 19:37:44,930 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 24 states. [2020-11-29 19:37:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:45,591 INFO L93 Difference]: Finished difference Result 938 states and 1317 transitions. [2020-11-29 19:37:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-29 19:37:45,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2020-11-29 19:37:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:45,597 INFO L225 Difference]: With dead ends: 938 [2020-11-29 19:37:45,598 INFO L226 Difference]: Without dead ends: 936 [2020-11-29 19:37:45,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2020-11-29 19:37:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2020-11-29 19:37:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2020-11-29 19:37:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-11-29 19:37:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2020-11-29 19:37:45,629 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2020-11-29 19:37:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:45,630 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2020-11-29 19:37:45,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-29 19:37:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2020-11-29 19:37:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-11-29 19:37:45,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:45,633 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-11-29 19:37:45,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-11-29 19:37:45,857 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2020-11-29 19:37:45,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:45,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189454178] [2020-11-29 19:37:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-29 19:37:46,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189454178] [2020-11-29 19:37:46,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779523821] [2020-11-29 19:37:46,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:46,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:46,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:46,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 19:37:46,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-29 19:37:46,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:46,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 19:37:46,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175090375] [2020-11-29 19:37:46,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 19:37:46,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:37:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:37:46,455 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 13 states. [2020-11-29 19:37:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:46,739 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2020-11-29 19:37:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:37:46,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 211 [2020-11-29 19:37:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:46,745 INFO L225 Difference]: With dead ends: 1125 [2020-11-29 19:37:46,745 INFO L226 Difference]: Without dead ends: 1040 [2020-11-29 19:37:46,746 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-11-29 19:37:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-11-29 19:37:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2020-11-29 19:37:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2020-11-29 19:37:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2020-11-29 19:37:46,782 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2020-11-29 19:37:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:46,783 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2020-11-29 19:37:46,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 19:37:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2020-11-29 19:37:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-29 19:37:46,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:46,785 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-11-29 19:37:46,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-11-29 19:37:46,991 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2020-11-29 19:37:46,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:46,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021612253] [2020-11-29 19:37:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-29 19:37:47,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021612253] [2020-11-29 19:37:47,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232668549] [2020-11-29 19:37:47,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:47,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 19:37:47,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:47,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 19:37:47,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-29 19:37:47,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:47,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-11-29 19:37:47,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215379759] [2020-11-29 19:37:47,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-29 19:37:47,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-29 19:37:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:37:47,771 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 14 states. [2020-11-29 19:37:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:48,040 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2020-11-29 19:37:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 19:37:48,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 239 [2020-11-29 19:37:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:48,048 INFO L225 Difference]: With dead ends: 1675 [2020-11-29 19:37:48,048 INFO L226 Difference]: Without dead ends: 1121 [2020-11-29 19:37:48,050 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-11-29 19:37:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-11-29 19:37:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2020-11-29 19:37:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-11-29 19:37:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2020-11-29 19:37:48,088 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2020-11-29 19:37:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:48,089 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2020-11-29 19:37:48,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-29 19:37:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2020-11-29 19:37:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-29 19:37:48,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:48,091 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-11-29 19:37:48,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-11-29 19:37:48,316 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2020-11-29 19:37:48,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:48,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252244794] [2020-11-29 19:37:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-11-29 19:37:48,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252244794] [2020-11-29 19:37:48,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273951288] [2020-11-29 19:37:48,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:49,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-11-29 19:37:49,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:49,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 23 conjunts are in the unsatisfiable core [2020-11-29 19:37:49,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-11-29 19:37:49,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:49,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-11-29 19:37:49,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192523813] [2020-11-29 19:37:49,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 19:37:49,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:49,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 19:37:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:37:49,274 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 15 states. [2020-11-29 19:37:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:49,653 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2020-11-29 19:37:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 19:37:49,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2020-11-29 19:37:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:49,662 INFO L225 Difference]: With dead ends: 1287 [2020-11-29 19:37:49,663 INFO L226 Difference]: Without dead ends: 1202 [2020-11-29 19:37:49,664 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-11-29 19:37:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-11-29 19:37:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2020-11-29 19:37:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2020-11-29 19:37:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2020-11-29 19:37:49,706 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2020-11-29 19:37:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:49,706 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2020-11-29 19:37:49,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 19:37:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2020-11-29 19:37:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2020-11-29 19:37:49,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:49,710 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-11-29 19:37:49,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-11-29 19:37:49,925 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2020-11-29 19:37:49,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:49,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377213856] [2020-11-29 19:37:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-11-29 19:37:50,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377213856] [2020-11-29 19:37:50,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265406938] [2020-11-29 19:37:50,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:50,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 19:37:50,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:50,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:37:50,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2020-11-29 19:37:50,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:50,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2020-11-29 19:37:50,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312886963] [2020-11-29 19:37:50,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 19:37:50,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 19:37:50,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:37:50,734 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2020-11-29 19:37:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:51,630 INFO L93 Difference]: Finished difference Result 1316 states and 1835 transitions. [2020-11-29 19:37:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-29 19:37:51,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2020-11-29 19:37:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:51,635 INFO L225 Difference]: With dead ends: 1316 [2020-11-29 19:37:51,635 INFO L226 Difference]: Without dead ends: 684 [2020-11-29 19:37:51,640 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-11-29 19:37:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-11-29 19:37:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 659. [2020-11-29 19:37:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-11-29 19:37:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2020-11-29 19:37:51,659 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2020-11-29 19:37:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:51,660 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2020-11-29 19:37:51,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 19:37:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2020-11-29 19:37:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-11-29 19:37:51,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:51,663 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-11-29 19:37:51,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-29 19:37:51,885 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2020-11-29 19:37:51,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:51,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116407712] [2020-11-29 19:37:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:37:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-11-29 19:37:52,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116407712] [2020-11-29 19:37:52,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410324655] [2020-11-29 19:37:52,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/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-11-29 19:37:52,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 19:37:52,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:37:52,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-29 19:37:52,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:37:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-11-29 19:37:53,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:37:53,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2020-11-29 19:37:53,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071370957] [2020-11-29 19:37:53,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-29 19:37:53,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:37:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 19:37:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-11-29 19:37:53,190 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 19 states. [2020-11-29 19:37:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:37:53,461 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2020-11-29 19:37:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-29 19:37:53,462 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 349 [2020-11-29 19:37:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:37:53,466 INFO L225 Difference]: With dead ends: 865 [2020-11-29 19:37:53,466 INFO L226 Difference]: Without dead ends: 780 [2020-11-29 19:37:53,467 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-11-29 19:37:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-11-29 19:37:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2020-11-29 19:37:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2020-11-29 19:37:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2020-11-29 19:37:53,490 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2020-11-29 19:37:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:37:53,491 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2020-11-29 19:37:53,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-29 19:37:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2020-11-29 19:37:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2020-11-29 19:37:53,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:37:53,496 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-11-29 19:37:53,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:37:53,721 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:37:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:37:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2020-11-29 19:37:53,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:37:53,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807015176] [2020-11-29 19:37:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:37:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:37:55,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:37:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:37:55,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:37:56,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:37:56,218 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:37:56,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-29 19:37:56,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:37:56 BoogieIcfgContainer [2020-11-29 19:37:56,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:37:56,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:37:56,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:37:56,526 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:37:56,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:37:10" (3/4) ... [2020-11-29 19:37:56,528 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:37:56,879 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e1eef41-480e-494e-b195-ad47b09ecaa3/bin/uautomizer/witness.graphml [2020-11-29 19:37:56,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:37:56,881 INFO L168 Benchmark]: Toolchain (without parser) took 48488.14 ms. Allocated memory was 96.5 MB in the beginning and 627.0 MB in the end (delta: 530.6 MB). Free memory was 64.4 MB in the beginning and 448.5 MB in the end (delta: -384.1 MB). Peak memory consumption was 147.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,883 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 50.6 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:37:56,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.25 ms. Allocated memory is still 96.5 MB. Free memory was 64.2 MB in the beginning and 66.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.75 ms. Allocated memory is still 96.5 MB. Free memory was 65.7 MB in the beginning and 61.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,884 INFO L168 Benchmark]: Boogie Preprocessor took 75.59 ms. Allocated memory is still 96.5 MB. Free memory was 61.5 MB in the beginning and 58.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,884 INFO L168 Benchmark]: RCFGBuilder took 1559.13 ms. Allocated memory is still 96.5 MB. Free memory was 58.2 MB in the beginning and 70.9 MB in the end (delta: -12.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,885 INFO L168 Benchmark]: TraceAbstraction took 45705.96 ms. Allocated memory was 96.5 MB in the beginning and 627.0 MB in the end (delta: 530.6 MB). Free memory was 70.4 MB in the beginning and 493.6 MB in the end (delta: -423.3 MB). Peak memory consumption was 380.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,885 INFO L168 Benchmark]: Witness Printer took 354.42 ms. Allocated memory is still 627.0 MB. Free memory was 493.6 MB in the beginning and 448.5 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:37:56,888 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.35 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 50.6 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 655.25 ms. Allocated memory is still 96.5 MB. Free memory was 64.2 MB in the beginning and 66.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 128.75 ms. Allocated memory is still 96.5 MB. Free memory was 65.7 MB in the beginning and 61.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.59 ms. Allocated memory is still 96.5 MB. Free memory was 61.5 MB in the beginning and 58.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1559.13 ms. Allocated memory is still 96.5 MB. Free memory was 58.2 MB in the beginning and 70.9 MB in the end (delta: -12.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 45705.96 ms. Allocated memory was 96.5 MB in the beginning and 627.0 MB in the end (delta: 530.6 MB). Free memory was 70.4 MB in the beginning and 493.6 MB in the end (delta: -423.3 MB). Peak memory consumption was 380.0 MB. Max. memory is 16.1 GB. * Witness Printer took 354.42 ms. Allocated memory is still 627.0 MB. Free memory was 493.6 MB in the beginning and 448.5 MB in the end (delta: 45.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: 45.3s, OverallIterations: 40, TraceHistogramMax: 35, AutomataDifference: 12.9s, 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4454 GetRequests, 4039 SyntacticMatches, 28 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 9.0s 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.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 385 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 12.2s 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...