./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.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_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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 a2cb7dd7cbe25a85ad6bdbcb76856248329abedc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30 01:28:56,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:28:56,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:28:56,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:28:56,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:28:56,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:28:56,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:28:56,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:28:56,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:28:56,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:28:56,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:28:56,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:28:56,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:28:56,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:28:56,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:28:56,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:28:56,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:28:56,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:28:56,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:28:56,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:28:56,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:28:56,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:28:56,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:28:56,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:28:56,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:28:56,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:28:56,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:28:56,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:28:56,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:28:56,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:28:56,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:28:56,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:28:56,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:28:56,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:28:56,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:28:56,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:28:56,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:28:56,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:28:56,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:28:56,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:28:56,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:28:56,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:28:57,018 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:28:57,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:28:57,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:28:57,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:28:57,021 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:28:57,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:28:57,022 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:28:57,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:28:57,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:28:57,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:28:57,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:28:57,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:28:57,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:28:57,024 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:28:57,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:28:57,025 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:28:57,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:28:57,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:28:57,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:28:57,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:28:57,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:28:57,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:28:57,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:28:57,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:28:57,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:28:57,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:28:57,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:28:57,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:28:57,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:28:57,029 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_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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 -> a2cb7dd7cbe25a85ad6bdbcb76856248329abedc [2020-11-30 01:28:57,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:28:57,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:28:57,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:28:57,434 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:28:57,435 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:28:57,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-11-30 01:28:57,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/data/ecaa018ae/c4f0f70c75904bc7804641d8f8a6e193/FLAGe6a751413 [2020-11-30 01:28:58,254 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:28:58,255 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-11-30 01:28:58,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/data/ecaa018ae/c4f0f70c75904bc7804641d8f8a6e193/FLAGe6a751413 [2020-11-30 01:28:58,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/data/ecaa018ae/c4f0f70c75904bc7804641d8f8a6e193 [2020-11-30 01:28:58,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:28:58,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:28:58,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:28:58,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:28:58,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:28:58,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:28:58" (1/1) ... [2020-11-30 01:28:58,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222b4f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:58, skipping insertion in model container [2020-11-30 01:28:58,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:28:58" (1/1) ... [2020-11-30 01:28:58,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:28:58,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:28:58,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:28:58,970 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:28:59,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:28:59,071 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:28:59,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59 WrapperNode [2020-11-30 01:28:59,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:28:59,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:28:59,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:28:59,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:28:59,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:28:59,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:28:59,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:28:59,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:28:59,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... [2020-11-30 01:28:59,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:28:59,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:28:59,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:28:59,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:28:59,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:28:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:28:59,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:28:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:28:59,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:29:02,320 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:29:02,320 INFO L298 CfgBuilder]: Removed 247 assume(true) statements. [2020-11-30 01:29:02,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:29:02 BoogieIcfgContainer [2020-11-30 01:29:02,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:29:02,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:29:02,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:29:02,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:29:02,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:28:58" (1/3) ... [2020-11-30 01:29:02,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f02c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:29:02, skipping insertion in model container [2020-11-30 01:29:02,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:28:59" (2/3) ... [2020-11-30 01:29:02,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f02c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:29:02, skipping insertion in model container [2020-11-30 01:29:02,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:29:02" (3/3) ... [2020-11-30 01:29:02,341 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2020-11-30 01:29:02,353 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:29:02,357 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2020-11-30 01:29:02,371 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2020-11-30 01:29:02,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:29:02,410 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:29:02,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:29:02,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:29:02,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:29:02,411 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:29:02,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:29:02,411 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:29:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states. [2020-11-30 01:29:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:29:02,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:02,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:02,466 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2020-11-30 01:29:02,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:02,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083692667] [2020-11-30 01:29:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:02,736 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-30 01:29:02,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083692667] [2020-11-30 01:29:02,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:02,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:02,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926267644] [2020-11-30 01:29:02,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:02,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:02,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:02,785 INFO L87 Difference]: Start difference. First operand 555 states. Second operand 3 states. [2020-11-30 01:29:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:03,254 INFO L93 Difference]: Finished difference Result 1281 states and 2094 transitions. [2020-11-30 01:29:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:03,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 01:29:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:03,303 INFO L225 Difference]: With dead ends: 1281 [2020-11-30 01:29:03,304 INFO L226 Difference]: Without dead ends: 720 [2020-11-30 01:29:03,312 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-30 01:29:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-11-30 01:29:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 454. [2020-11-30 01:29:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-30 01:29:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 709 transitions. [2020-11-30 01:29:03,451 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 709 transitions. Word has length 9 [2020-11-30 01:29:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:03,452 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 709 transitions. [2020-11-30 01:29:03,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 709 transitions. [2020-11-30 01:29:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:29:03,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:03,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:03,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:29:03,457 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1330220136, now seen corresponding path program 1 times [2020-11-30 01:29:03,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:03,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754527021] [2020-11-30 01:29:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:03,584 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-30 01:29:03,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754527021] [2020-11-30 01:29:03,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:03,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:03,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652906596] [2020-11-30 01:29:03,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:03,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:03,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:03,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:03,588 INFO L87 Difference]: Start difference. First operand 454 states and 709 transitions. Second operand 3 states. [2020-11-30 01:29:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:03,709 INFO L93 Difference]: Finished difference Result 1122 states and 1737 transitions. [2020-11-30 01:29:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:03,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 01:29:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:03,721 INFO L225 Difference]: With dead ends: 1122 [2020-11-30 01:29:03,721 INFO L226 Difference]: Without dead ends: 670 [2020-11-30 01:29:03,723 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-30 01:29:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2020-11-30 01:29:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 421. [2020-11-30 01:29:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-30 01:29:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2020-11-30 01:29:03,757 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 10 [2020-11-30 01:29:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:03,757 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2020-11-30 01:29:03,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2020-11-30 01:29:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:29:03,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:03,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:03,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:29:03,760 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1243418079, now seen corresponding path program 1 times [2020-11-30 01:29:03,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:03,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421223642] [2020-11-30 01:29:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:03,876 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-30 01:29:03,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421223642] [2020-11-30 01:29:03,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:03,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:03,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423468739] [2020-11-30 01:29:03,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:03,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:03,880 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand 3 states. [2020-11-30 01:29:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:04,011 INFO L93 Difference]: Finished difference Result 1241 states and 1924 transitions. [2020-11-30 01:29:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:04,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-30 01:29:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:04,020 INFO L225 Difference]: With dead ends: 1241 [2020-11-30 01:29:04,020 INFO L226 Difference]: Without dead ends: 830 [2020-11-30 01:29:04,022 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-30 01:29:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-11-30 01:29:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 425. [2020-11-30 01:29:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-11-30 01:29:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 655 transitions. [2020-11-30 01:29:04,059 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 655 transitions. Word has length 14 [2020-11-30 01:29:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:04,059 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 655 transitions. [2020-11-30 01:29:04,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 655 transitions. [2020-11-30 01:29:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:29:04,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:04,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:04,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:29:04,062 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1419090732, now seen corresponding path program 1 times [2020-11-30 01:29:04,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:04,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286944579] [2020-11-30 01:29:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:04,191 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-30 01:29:04,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286944579] [2020-11-30 01:29:04,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:04,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:04,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856848448] [2020-11-30 01:29:04,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:04,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:04,194 INFO L87 Difference]: Start difference. First operand 425 states and 655 transitions. Second operand 4 states. [2020-11-30 01:29:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:04,353 INFO L93 Difference]: Finished difference Result 1564 states and 2392 transitions. [2020-11-30 01:29:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:04,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 01:29:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:04,363 INFO L225 Difference]: With dead ends: 1564 [2020-11-30 01:29:04,363 INFO L226 Difference]: Without dead ends: 1153 [2020-11-30 01:29:04,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2020-11-30 01:29:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 427. [2020-11-30 01:29:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 01:29:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 657 transitions. [2020-11-30 01:29:04,392 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 657 transitions. Word has length 18 [2020-11-30 01:29:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:04,392 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 657 transitions. [2020-11-30 01:29:04,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 657 transitions. [2020-11-30 01:29:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 01:29:04,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:04,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:04,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:29:04,400 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash 703965683, now seen corresponding path program 1 times [2020-11-30 01:29:04,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:04,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730265791] [2020-11-30 01:29:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:04,510 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-30 01:29:04,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730265791] [2020-11-30 01:29:04,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:04,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:04,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017420421] [2020-11-30 01:29:04,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:04,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:04,512 INFO L87 Difference]: Start difference. First operand 427 states and 657 transitions. Second operand 4 states. [2020-11-30 01:29:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:04,584 INFO L93 Difference]: Finished difference Result 904 states and 1380 transitions. [2020-11-30 01:29:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:04,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-11-30 01:29:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:04,590 INFO L225 Difference]: With dead ends: 904 [2020-11-30 01:29:04,590 INFO L226 Difference]: Without dead ends: 662 [2020-11-30 01:29:04,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-11-30 01:29:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 425. [2020-11-30 01:29:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-11-30 01:29:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 650 transitions. [2020-11-30 01:29:04,611 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 650 transitions. Word has length 19 [2020-11-30 01:29:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:04,612 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 650 transitions. [2020-11-30 01:29:04,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 650 transitions. [2020-11-30 01:29:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:29:04,615 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:04,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:04,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:29:04,616 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash 628676147, now seen corresponding path program 1 times [2020-11-30 01:29:04,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:04,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577443983] [2020-11-30 01:29:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:04,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577443983] [2020-11-30 01:29:04,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512302992] [2020-11-30 01:29:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:04,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:29:04,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:29:05,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:05,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-30 01:29:05,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073155220] [2020-11-30 01:29:05,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:29:05,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:29:05,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:05,005 INFO L87 Difference]: Start difference. First operand 425 states and 650 transitions. Second operand 5 states. [2020-11-30 01:29:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:05,264 INFO L93 Difference]: Finished difference Result 1655 states and 2545 transitions. [2020-11-30 01:29:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:29:05,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-30 01:29:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:05,275 INFO L225 Difference]: With dead ends: 1655 [2020-11-30 01:29:05,275 INFO L226 Difference]: Without dead ends: 1241 [2020-11-30 01:29:05,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-11-30 01:29:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 571. [2020-11-30 01:29:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-11-30 01:29:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 900 transitions. [2020-11-30 01:29:05,315 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 900 transitions. Word has length 21 [2020-11-30 01:29:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:05,315 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 900 transitions. [2020-11-30 01:29:05,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:29:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 900 transitions. [2020-11-30 01:29:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:29:05,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:05,319 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:05,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-30 01:29:05,549 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -837838367, now seen corresponding path program 2 times [2020-11-30 01:29:05,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:05,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228888688] [2020-11-30 01:29:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 01:29:05,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228888688] [2020-11-30 01:29:05,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:05,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:05,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721702076] [2020-11-30 01:29:05,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:05,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:05,627 INFO L87 Difference]: Start difference. First operand 571 states and 900 transitions. Second operand 3 states. [2020-11-30 01:29:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:05,707 INFO L93 Difference]: Finished difference Result 1299 states and 2027 transitions. [2020-11-30 01:29:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:05,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 01:29:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:05,714 INFO L225 Difference]: With dead ends: 1299 [2020-11-30 01:29:05,714 INFO L226 Difference]: Without dead ends: 766 [2020-11-30 01:29:05,716 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-30 01:29:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-11-30 01:29:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 520. [2020-11-30 01:29:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2020-11-30 01:29:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 806 transitions. [2020-11-30 01:29:05,742 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 806 transitions. Word has length 28 [2020-11-30 01:29:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:05,743 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 806 transitions. [2020-11-30 01:29:05,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 806 transitions. [2020-11-30 01:29:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:29:05,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:05,744 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:05,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:29:05,745 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1453457771, now seen corresponding path program 1 times [2020-11-30 01:29:05,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:05,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663960869] [2020-11-30 01:29:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 01:29:05,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663960869] [2020-11-30 01:29:05,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:05,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:05,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587196415] [2020-11-30 01:29:05,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:05,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:05,816 INFO L87 Difference]: Start difference. First operand 520 states and 806 transitions. Second operand 3 states. [2020-11-30 01:29:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:05,985 INFO L93 Difference]: Finished difference Result 1179 states and 1809 transitions. [2020-11-30 01:29:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:05,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 01:29:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:05,991 INFO L225 Difference]: With dead ends: 1179 [2020-11-30 01:29:05,991 INFO L226 Difference]: Without dead ends: 688 [2020-11-30 01:29:05,993 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-30 01:29:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-11-30 01:29:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 454. [2020-11-30 01:29:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-30 01:29:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 681 transitions. [2020-11-30 01:29:06,015 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 681 transitions. Word has length 28 [2020-11-30 01:29:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:06,016 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 681 transitions. [2020-11-30 01:29:06,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 681 transitions. [2020-11-30 01:29:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 01:29:06,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:06,020 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:29:06,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:29:06,021 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1581264384, now seen corresponding path program 1 times [2020-11-30 01:29:06,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:06,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490122200] [2020-11-30 01:29:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 01:29:06,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490122200] [2020-11-30 01:29:06,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:06,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:06,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545537536] [2020-11-30 01:29:06,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:06,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:06,104 INFO L87 Difference]: Start difference. First operand 454 states and 681 transitions. Second operand 4 states. [2020-11-30 01:29:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:06,198 INFO L93 Difference]: Finished difference Result 1090 states and 1641 transitions. [2020-11-30 01:29:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:29:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-30 01:29:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:06,206 INFO L225 Difference]: With dead ends: 1090 [2020-11-30 01:29:06,206 INFO L226 Difference]: Without dead ends: 680 [2020-11-30 01:29:06,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-11-30 01:29:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 454. [2020-11-30 01:29:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-11-30 01:29:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 679 transitions. [2020-11-30 01:29:06,229 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 679 transitions. Word has length 38 [2020-11-30 01:29:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:06,229 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 679 transitions. [2020-11-30 01:29:06,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 679 transitions. [2020-11-30 01:29:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-30 01:29:06,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:06,234 INFO L422 BasicCegarLoop]: trace histogram [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-30 01:29:06,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:29:06,235 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1902944388, now seen corresponding path program 1 times [2020-11-30 01:29:06,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:06,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957068647] [2020-11-30 01:29:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 01:29:06,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957068647] [2020-11-30 01:29:06,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:06,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:06,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876416615] [2020-11-30 01:29:06,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:06,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:06,332 INFO L87 Difference]: Start difference. First operand 454 states and 679 transitions. Second operand 3 states. [2020-11-30 01:29:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:06,425 INFO L93 Difference]: Finished difference Result 1026 states and 1540 transitions. [2020-11-30 01:29:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:06,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-30 01:29:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:06,432 INFO L225 Difference]: With dead ends: 1026 [2020-11-30 01:29:06,433 INFO L226 Difference]: Without dead ends: 635 [2020-11-30 01:29:06,434 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-30 01:29:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-11-30 01:29:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 410. [2020-11-30 01:29:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-11-30 01:29:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2020-11-30 01:29:06,472 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 50 [2020-11-30 01:29:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:06,475 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2020-11-30 01:29:06,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2020-11-30 01:29:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-30 01:29:06,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:06,478 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:06,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:29:06,478 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1215657471, now seen corresponding path program 1 times [2020-11-30 01:29:06,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:06,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570579479] [2020-11-30 01:29:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 01:29:06,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570579479] [2020-11-30 01:29:06,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:06,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:06,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054605730] [2020-11-30 01:29:06,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:06,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:06,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:06,586 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 3 states. [2020-11-30 01:29:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:06,707 INFO L93 Difference]: Finished difference Result 860 states and 1269 transitions. [2020-11-30 01:29:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:06,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-30 01:29:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:06,713 INFO L225 Difference]: With dead ends: 860 [2020-11-30 01:29:06,713 INFO L226 Difference]: Without dead ends: 505 [2020-11-30 01:29:06,714 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-30 01:29:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-11-30 01:29:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 366. [2020-11-30 01:29:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-11-30 01:29:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 517 transitions. [2020-11-30 01:29:06,736 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 517 transitions. Word has length 51 [2020-11-30 01:29:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:06,737 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 517 transitions. [2020-11-30 01:29:06,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 517 transitions. [2020-11-30 01:29:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 01:29:06,739 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:06,739 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:06,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:29:06,740 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash -64177626, now seen corresponding path program 1 times [2020-11-30 01:29:06,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:06,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880920344] [2020-11-30 01:29:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-30 01:29:06,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880920344] [2020-11-30 01:29:06,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:06,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:06,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324932703] [2020-11-30 01:29:06,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:06,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:06,842 INFO L87 Difference]: Start difference. First operand 366 states and 517 transitions. Second operand 4 states. [2020-11-30 01:29:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:06,922 INFO L93 Difference]: Finished difference Result 868 states and 1248 transitions. [2020-11-30 01:29:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:29:06,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-11-30 01:29:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:06,935 INFO L225 Difference]: With dead ends: 868 [2020-11-30 01:29:06,936 INFO L226 Difference]: Without dead ends: 574 [2020-11-30 01:29:06,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-11-30 01:29:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 366. [2020-11-30 01:29:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-11-30 01:29:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 515 transitions. [2020-11-30 01:29:06,957 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 515 transitions. Word has length 62 [2020-11-30 01:29:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:06,959 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 515 transitions. [2020-11-30 01:29:06,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2020-11-30 01:29:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-30 01:29:06,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:06,961 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-30 01:29:06,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:29:06,962 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash 461299335, now seen corresponding path program 1 times [2020-11-30 01:29:06,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:06,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930612451] [2020-11-30 01:29:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 01:29:07,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930612451] [2020-11-30 01:29:07,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419107087] [2020-11-30 01:29:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:07,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:29:07,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 01:29:07,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:07,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-30 01:29:07,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758414161] [2020-11-30 01:29:07,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:29:07,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:29:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:07,372 INFO L87 Difference]: Start difference. First operand 366 states and 515 transitions. Second operand 6 states. [2020-11-30 01:29:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:07,520 INFO L93 Difference]: Finished difference Result 1414 states and 2021 transitions. [2020-11-30 01:29:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:07,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-11-30 01:29:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:07,528 INFO L225 Difference]: With dead ends: 1414 [2020-11-30 01:29:07,529 INFO L226 Difference]: Without dead ends: 1067 [2020-11-30 01:29:07,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2020-11-30 01:29:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 439. [2020-11-30 01:29:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-30 01:29:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 612 transitions. [2020-11-30 01:29:07,557 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 612 transitions. Word has length 76 [2020-11-30 01:29:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:07,557 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 612 transitions. [2020-11-30 01:29:07,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:29:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 612 transitions. [2020-11-30 01:29:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-30 01:29:07,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:07,559 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:07,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 01:29:07,773 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1414363196, now seen corresponding path program 2 times [2020-11-30 01:29:07,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:07,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842823737] [2020-11-30 01:29:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 01:29:07,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842823737] [2020-11-30 01:29:07,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:07,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:07,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412828656] [2020-11-30 01:29:07,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:07,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:07,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:07,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:07,917 INFO L87 Difference]: Start difference. First operand 439 states and 612 transitions. Second operand 3 states. [2020-11-30 01:29:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:07,998 INFO L93 Difference]: Finished difference Result 856 states and 1238 transitions. [2020-11-30 01:29:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:07,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-11-30 01:29:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,003 INFO L225 Difference]: With dead ends: 856 [2020-11-30 01:29:08,004 INFO L226 Difference]: Without dead ends: 559 [2020-11-30 01:29:08,005 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-30 01:29:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-11-30 01:29:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 395. [2020-11-30 01:29:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-11-30 01:29:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 554 transitions. [2020-11-30 01:29:08,030 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 554 transitions. Word has length 103 [2020-11-30 01:29:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:08,030 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 554 transitions. [2020-11-30 01:29:08,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 554 transitions. [2020-11-30 01:29:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-30 01:29:08,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:08,043 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:08,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:29:08,043 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:08,044 INFO L82 PathProgramCache]: Analyzing trace with hash -262724973, now seen corresponding path program 1 times [2020-11-30 01:29:08,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:08,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005715967] [2020-11-30 01:29:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 01:29:08,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005715967] [2020-11-30 01:29:08,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:08,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:08,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142298316] [2020-11-30 01:29:08,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:08,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:08,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:08,156 INFO L87 Difference]: Start difference. First operand 395 states and 554 transitions. Second operand 3 states. [2020-11-30 01:29:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:08,205 INFO L93 Difference]: Finished difference Result 568 states and 813 transitions. [2020-11-30 01:29:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:08,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-11-30 01:29:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,209 INFO L225 Difference]: With dead ends: 568 [2020-11-30 01:29:08,209 INFO L226 Difference]: Without dead ends: 311 [2020-11-30 01:29:08,212 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-30 01:29:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-11-30 01:29:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2020-11-30 01:29:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-11-30 01:29:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 431 transitions. [2020-11-30 01:29:08,228 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 431 transitions. Word has length 112 [2020-11-30 01:29:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:08,228 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 431 transitions. [2020-11-30 01:29:08,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 431 transitions. [2020-11-30 01:29:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-30 01:29:08,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:08,230 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:08,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:29:08,231 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1252211039, now seen corresponding path program 1 times [2020-11-30 01:29:08,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:08,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240556648] [2020-11-30 01:29:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-30 01:29:08,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240556648] [2020-11-30 01:29:08,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:08,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:08,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14522047] [2020-11-30 01:29:08,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:08,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:08,340 INFO L87 Difference]: Start difference. First operand 311 states and 431 transitions. Second operand 4 states. [2020-11-30 01:29:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:08,396 INFO L93 Difference]: Finished difference Result 483 states and 689 transitions. [2020-11-30 01:29:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:29:08,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-11-30 01:29:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,400 INFO L225 Difference]: With dead ends: 483 [2020-11-30 01:29:08,400 INFO L226 Difference]: Without dead ends: 311 [2020-11-30 01:29:08,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-11-30 01:29:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2020-11-30 01:29:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-11-30 01:29:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 428 transitions. [2020-11-30 01:29:08,419 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 428 transitions. Word has length 115 [2020-11-30 01:29:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:08,420 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 428 transitions. [2020-11-30 01:29:08,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 428 transitions. [2020-11-30 01:29:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-30 01:29:08,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:08,422 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-30 01:29:08,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:29:08,423 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash 501578938, now seen corresponding path program 1 times [2020-11-30 01:29:08,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:08,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45558369] [2020-11-30 01:29:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 01:29:08,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45558369] [2020-11-30 01:29:08,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:08,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:08,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462248441] [2020-11-30 01:29:08,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:08,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:08,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:08,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:08,520 INFO L87 Difference]: Start difference. First operand 311 states and 428 transitions. Second operand 3 states. [2020-11-30 01:29:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:08,571 INFO L93 Difference]: Finished difference Result 612 states and 885 transitions. [2020-11-30 01:29:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:08,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-11-30 01:29:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,597 INFO L225 Difference]: With dead ends: 612 [2020-11-30 01:29:08,598 INFO L226 Difference]: Without dead ends: 445 [2020-11-30 01:29:08,602 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-30 01:29:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-30 01:29:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 306. [2020-11-30 01:29:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-11-30 01:29:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2020-11-30 01:29:08,625 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 126 [2020-11-30 01:29:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:08,625 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2020-11-30 01:29:08,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2020-11-30 01:29:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-30 01:29:08,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:08,628 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:08,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:29:08,629 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash 562455808, now seen corresponding path program 1 times [2020-11-30 01:29:08,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:08,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876274947] [2020-11-30 01:29:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 01:29:08,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876274947] [2020-11-30 01:29:08,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:08,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:08,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286315616] [2020-11-30 01:29:08,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:08,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:08,750 INFO L87 Difference]: Start difference. First operand 306 states and 420 transitions. Second operand 3 states. [2020-11-30 01:29:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:08,804 INFO L93 Difference]: Finished difference Result 593 states and 856 transitions. [2020-11-30 01:29:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:08,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-11-30 01:29:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,809 INFO L225 Difference]: With dead ends: 593 [2020-11-30 01:29:08,809 INFO L226 Difference]: Without dead ends: 431 [2020-11-30 01:29:08,810 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-30 01:29:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-11-30 01:29:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 302. [2020-11-30 01:29:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-11-30 01:29:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 413 transitions. [2020-11-30 01:29:08,832 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 413 transitions. Word has length 131 [2020-11-30 01:29:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:08,833 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 413 transitions. [2020-11-30 01:29:08,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 413 transitions. [2020-11-30 01:29:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 01:29:08,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:08,836 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:08,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:29:08,837 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash 475553694, now seen corresponding path program 1 times [2020-11-30 01:29:08,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:08,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889239123] [2020-11-30 01:29:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 01:29:08,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889239123] [2020-11-30 01:29:08,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:08,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:08,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840278931] [2020-11-30 01:29:08,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:08,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:08,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:08,947 INFO L87 Difference]: Start difference. First operand 302 states and 413 transitions. Second operand 3 states. [2020-11-30 01:29:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:08,990 INFO L93 Difference]: Finished difference Result 458 states and 649 transitions. [2020-11-30 01:29:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:08,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-11-30 01:29:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:08,994 INFO L225 Difference]: With dead ends: 458 [2020-11-30 01:29:08,994 INFO L226 Difference]: Without dead ends: 300 [2020-11-30 01:29:08,995 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-30 01:29:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-11-30 01:29:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2020-11-30 01:29:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-30 01:29:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 407 transitions. [2020-11-30 01:29:09,047 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 407 transitions. Word has length 137 [2020-11-30 01:29:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:09,048 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 407 transitions. [2020-11-30 01:29:09,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 407 transitions. [2020-11-30 01:29:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-30 01:29:09,051 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:09,051 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:09,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:29:09,053 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1872473539, now seen corresponding path program 1 times [2020-11-30 01:29:09,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:09,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363256019] [2020-11-30 01:29:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 01:29:09,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363256019] [2020-11-30 01:29:09,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:09,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:09,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302476382] [2020-11-30 01:29:09,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:09,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:09,195 INFO L87 Difference]: Start difference. First operand 299 states and 407 transitions. Second operand 3 states. [2020-11-30 01:29:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:09,215 INFO L93 Difference]: Finished difference Result 500 states and 708 transitions. [2020-11-30 01:29:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:09,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-11-30 01:29:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:09,219 INFO L225 Difference]: With dead ends: 500 [2020-11-30 01:29:09,219 INFO L226 Difference]: Without dead ends: 345 [2020-11-30 01:29:09,220 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-30 01:29:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-11-30 01:29:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 296. [2020-11-30 01:29:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-30 01:29:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 403 transitions. [2020-11-30 01:29:09,241 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 403 transitions. Word has length 144 [2020-11-30 01:29:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:09,241 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 403 transitions. [2020-11-30 01:29:09,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 403 transitions. [2020-11-30 01:29:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-30 01:29:09,244 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:09,244 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:09,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:29:09,245 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2083787767, now seen corresponding path program 1 times [2020-11-30 01:29:09,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:09,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22746629] [2020-11-30 01:29:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-30 01:29:09,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22746629] [2020-11-30 01:29:09,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:09,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:09,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887882890] [2020-11-30 01:29:09,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:09,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:09,399 INFO L87 Difference]: Start difference. First operand 296 states and 403 transitions. Second operand 3 states. [2020-11-30 01:29:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:09,442 INFO L93 Difference]: Finished difference Result 478 states and 668 transitions. [2020-11-30 01:29:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:09,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-11-30 01:29:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:09,445 INFO L225 Difference]: With dead ends: 478 [2020-11-30 01:29:09,446 INFO L226 Difference]: Without dead ends: 296 [2020-11-30 01:29:09,446 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-30 01:29:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-11-30 01:29:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2020-11-30 01:29:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-30 01:29:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 400 transitions. [2020-11-30 01:29:09,464 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 400 transitions. Word has length 147 [2020-11-30 01:29:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:09,465 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 400 transitions. [2020-11-30 01:29:09,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2020-11-30 01:29:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-30 01:29:09,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:09,468 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:09,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:29:09,469 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1747264437, now seen corresponding path program 1 times [2020-11-30 01:29:09,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:09,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622865147] [2020-11-30 01:29:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:09,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622865147] [2020-11-30 01:29:09,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:09,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:09,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028803858] [2020-11-30 01:29:09,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:09,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:09,693 INFO L87 Difference]: Start difference. First operand 296 states and 400 transitions. Second operand 4 states. [2020-11-30 01:29:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:09,837 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2020-11-30 01:29:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:09,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-11-30 01:29:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:09,844 INFO L225 Difference]: With dead ends: 624 [2020-11-30 01:29:09,844 INFO L226 Difference]: Without dead ends: 472 [2020-11-30 01:29:09,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-11-30 01:29:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 378. [2020-11-30 01:29:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-30 01:29:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2020-11-30 01:29:09,873 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 159 [2020-11-30 01:29:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:09,874 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2020-11-30 01:29:09,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2020-11-30 01:29:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-30 01:29:09,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:09,877 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:09,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:29:09,877 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1373332782, now seen corresponding path program 1 times [2020-11-30 01:29:09,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:09,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532888876] [2020-11-30 01:29:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:10,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532888876] [2020-11-30 01:29:10,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:10,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:10,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860409803] [2020-11-30 01:29:10,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:10,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:10,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:10,032 INFO L87 Difference]: Start difference. First operand 378 states and 518 transitions. Second operand 3 states. [2020-11-30 01:29:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:10,098 INFO L93 Difference]: Finished difference Result 783 states and 1118 transitions. [2020-11-30 01:29:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:10,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-30 01:29:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:10,103 INFO L225 Difference]: With dead ends: 783 [2020-11-30 01:29:10,104 INFO L226 Difference]: Without dead ends: 587 [2020-11-30 01:29:10,105 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-30 01:29:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-11-30 01:29:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 448. [2020-11-30 01:29:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-11-30 01:29:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 617 transitions. [2020-11-30 01:29:10,141 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 617 transitions. Word has length 176 [2020-11-30 01:29:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:10,141 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 617 transitions. [2020-11-30 01:29:10,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 617 transitions. [2020-11-30 01:29:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-30 01:29:10,144 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:10,145 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:10,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:29:10,146 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash 914197344, now seen corresponding path program 1 times [2020-11-30 01:29:10,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:10,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394007631] [2020-11-30 01:29:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:10,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394007631] [2020-11-30 01:29:10,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:10,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:10,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413322791] [2020-11-30 01:29:10,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:10,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:10,301 INFO L87 Difference]: Start difference. First operand 448 states and 617 transitions. Second operand 3 states. [2020-11-30 01:29:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:10,371 INFO L93 Difference]: Finished difference Result 932 states and 1331 transitions. [2020-11-30 01:29:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:10,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-11-30 01:29:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:10,377 INFO L225 Difference]: With dead ends: 932 [2020-11-30 01:29:10,377 INFO L226 Difference]: Without dead ends: 693 [2020-11-30 01:29:10,378 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-30 01:29:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-11-30 01:29:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 542. [2020-11-30 01:29:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-11-30 01:29:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 751 transitions. [2020-11-30 01:29:10,422 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 751 transitions. Word has length 177 [2020-11-30 01:29:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:10,423 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 751 transitions. [2020-11-30 01:29:10,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 751 transitions. [2020-11-30 01:29:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-30 01:29:10,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:10,426 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:10,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:29:10,427 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -130058217, now seen corresponding path program 1 times [2020-11-30 01:29:10,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:10,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286249322] [2020-11-30 01:29:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:10,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286249322] [2020-11-30 01:29:10,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:10,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:10,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461529282] [2020-11-30 01:29:10,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:10,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:10,570 INFO L87 Difference]: Start difference. First operand 542 states and 751 transitions. Second operand 3 states. [2020-11-30 01:29:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:10,674 INFO L93 Difference]: Finished difference Result 1108 states and 1589 transitions. [2020-11-30 01:29:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:10,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-30 01:29:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:10,682 INFO L225 Difference]: With dead ends: 1108 [2020-11-30 01:29:10,682 INFO L226 Difference]: Without dead ends: 805 [2020-11-30 01:29:10,683 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-30 01:29:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-30 01:29:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 628. [2020-11-30 01:29:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-30 01:29:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 879 transitions. [2020-11-30 01:29:10,737 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 879 transitions. Word has length 178 [2020-11-30 01:29:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:10,738 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 879 transitions. [2020-11-30 01:29:10,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 879 transitions. [2020-11-30 01:29:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-30 01:29:10,741 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:10,742 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:10,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 01:29:10,742 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 292643609, now seen corresponding path program 1 times [2020-11-30 01:29:10,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:10,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524265656] [2020-11-30 01:29:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 01:29:10,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524265656] [2020-11-30 01:29:10,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762012088] [2020-11-30 01:29:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:11,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:29:11,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:11,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:29:11,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 01:29:11,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664373542] [2020-11-30 01:29:11,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:11,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:11,363 INFO L87 Difference]: Start difference. First operand 628 states and 879 transitions. Second operand 3 states. [2020-11-30 01:29:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:11,506 INFO L93 Difference]: Finished difference Result 1256 states and 1747 transitions. [2020-11-30 01:29:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:11,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-30 01:29:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:11,512 INFO L225 Difference]: With dead ends: 1256 [2020-11-30 01:29:11,513 INFO L226 Difference]: Without dead ends: 875 [2020-11-30 01:29:11,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-30 01:29:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-11-30 01:29:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 628. [2020-11-30 01:29:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-30 01:29:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2020-11-30 01:29:11,567 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2020-11-30 01:29:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:11,568 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2020-11-30 01:29:11,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2020-11-30 01:29:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-30 01:29:11,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:11,571 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:11,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-30 01:29:11,792 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1978687721, now seen corresponding path program 1 times [2020-11-30 01:29:11,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:11,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100832596] [2020-11-30 01:29:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 01:29:11,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100832596] [2020-11-30 01:29:11,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210161386] [2020-11-30 01:29:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:12,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:29:12,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:12,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:29:12,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-11-30 01:29:12,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356046562] [2020-11-30 01:29:12,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:12,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:12,331 INFO L87 Difference]: Start difference. First operand 628 states and 870 transitions. Second operand 3 states. [2020-11-30 01:29:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:12,517 INFO L93 Difference]: Finished difference Result 1481 states and 2092 transitions. [2020-11-30 01:29:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:12,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-11-30 01:29:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:12,525 INFO L225 Difference]: With dead ends: 1481 [2020-11-30 01:29:12,526 INFO L226 Difference]: Without dead ends: 1100 [2020-11-30 01:29:12,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-30 01:29:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2020-11-30 01:29:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 628. [2020-11-30 01:29:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-30 01:29:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2020-11-30 01:29:12,587 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 179 [2020-11-30 01:29:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:12,588 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2020-11-30 01:29:12,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2020-11-30 01:29:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-30 01:29:12,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:12,593 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:12,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:29:12,820 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 700998875, now seen corresponding path program 1 times [2020-11-30 01:29:12,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:12,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653529405] [2020-11-30 01:29:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:12,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653529405] [2020-11-30 01:29:12,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:12,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:12,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203960687] [2020-11-30 01:29:12,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:12,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:12,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:12,992 INFO L87 Difference]: Start difference. First operand 628 states and 869 transitions. Second operand 3 states. [2020-11-30 01:29:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:13,053 INFO L93 Difference]: Finished difference Result 1011 states and 1430 transitions. [2020-11-30 01:29:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:13,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-30 01:29:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:13,059 INFO L225 Difference]: With dead ends: 1011 [2020-11-30 01:29:13,059 INFO L226 Difference]: Without dead ends: 610 [2020-11-30 01:29:13,061 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-30 01:29:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-11-30 01:29:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-11-30 01:29:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-30 01:29:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 835 transitions. [2020-11-30 01:29:13,116 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 835 transitions. Word has length 180 [2020-11-30 01:29:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:13,116 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 835 transitions. [2020-11-30 01:29:13,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 835 transitions. [2020-11-30 01:29:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-30 01:29:13,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:13,120 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:13,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:29:13,121 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash 772458455, now seen corresponding path program 1 times [2020-11-30 01:29:13,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:13,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373152700] [2020-11-30 01:29:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 01:29:13,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373152700] [2020-11-30 01:29:13,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796519550] [2020-11-30 01:29:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:13,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:29:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:13,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:29:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:13,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:29:13,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-11-30 01:29:13,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140506672] [2020-11-30 01:29:13,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:13,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:13,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:13,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:29:13,681 INFO L87 Difference]: Start difference. First operand 610 states and 835 transitions. Second operand 4 states. [2020-11-30 01:29:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:13,822 INFO L93 Difference]: Finished difference Result 1000 states and 1388 transitions. [2020-11-30 01:29:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-11-30 01:29:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:13,830 INFO L225 Difference]: With dead ends: 1000 [2020-11-30 01:29:13,830 INFO L226 Difference]: Without dead ends: 998 [2020-11-30 01:29:13,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:29:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2020-11-30 01:29:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 612. [2020-11-30 01:29:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-11-30 01:29:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 837 transitions. [2020-11-30 01:29:13,888 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 837 transitions. Word has length 180 [2020-11-30 01:29:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:13,889 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 837 transitions. [2020-11-30 01:29:13,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 837 transitions. [2020-11-30 01:29:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-11-30 01:29:13,891 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:13,892 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:14,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-30 01:29:14,120 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 168018617, now seen corresponding path program 1 times [2020-11-30 01:29:14,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:14,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86908811] [2020-11-30 01:29:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-11-30 01:29:14,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86908811] [2020-11-30 01:29:14,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:14,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:29:14,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180738919] [2020-11-30 01:29:14,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:29:14,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:29:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:29:14,464 INFO L87 Difference]: Start difference. First operand 612 states and 837 transitions. Second operand 9 states. [2020-11-30 01:29:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:15,243 INFO L93 Difference]: Finished difference Result 2633 states and 3697 transitions. [2020-11-30 01:29:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:29:15,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2020-11-30 01:29:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:15,261 INFO L225 Difference]: With dead ends: 2633 [2020-11-30 01:29:15,261 INFO L226 Difference]: Without dead ends: 2264 [2020-11-30 01:29:15,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:29:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2020-11-30 01:29:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 820. [2020-11-30 01:29:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-11-30 01:29:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1105 transitions. [2020-11-30 01:29:15,370 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1105 transitions. Word has length 183 [2020-11-30 01:29:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:15,370 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1105 transitions. [2020-11-30 01:29:15,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:29:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2020-11-30 01:29:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-11-30 01:29:15,374 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:15,374 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:15,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 01:29:15,375 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1111845061, now seen corresponding path program 1 times [2020-11-30 01:29:15,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:15,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147855669] [2020-11-30 01:29:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:15,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147855669] [2020-11-30 01:29:15,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:15,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:15,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912902238] [2020-11-30 01:29:15,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:15,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:15,483 INFO L87 Difference]: Start difference. First operand 820 states and 1105 transitions. Second operand 3 states. [2020-11-30 01:29:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:15,711 INFO L93 Difference]: Finished difference Result 1825 states and 2496 transitions. [2020-11-30 01:29:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:15,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2020-11-30 01:29:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:15,720 INFO L225 Difference]: With dead ends: 1825 [2020-11-30 01:29:15,720 INFO L226 Difference]: Without dead ends: 1456 [2020-11-30 01:29:15,722 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-30 01:29:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-11-30 01:29:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 820. [2020-11-30 01:29:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-11-30 01:29:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1103 transitions. [2020-11-30 01:29:15,806 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1103 transitions. Word has length 183 [2020-11-30 01:29:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:15,807 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1103 transitions. [2020-11-30 01:29:15,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1103 transitions. [2020-11-30 01:29:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-30 01:29:15,811 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:15,811 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:15,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 01:29:15,812 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -43840079, now seen corresponding path program 1 times [2020-11-30 01:29:15,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:15,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321503397] [2020-11-30 01:29:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-11-30 01:29:15,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321503397] [2020-11-30 01:29:15,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:15,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:29:15,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543910869] [2020-11-30 01:29:15,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:29:15,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:29:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:29:15,906 INFO L87 Difference]: Start difference. First operand 820 states and 1103 transitions. Second operand 3 states. [2020-11-30 01:29:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:16,022 INFO L93 Difference]: Finished difference Result 1372 states and 1859 transitions. [2020-11-30 01:29:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:29:16,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2020-11-30 01:29:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:16,027 INFO L225 Difference]: With dead ends: 1372 [2020-11-30 01:29:16,028 INFO L226 Difference]: Without dead ends: 673 [2020-11-30 01:29:16,029 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-30 01:29:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2020-11-30 01:29:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2020-11-30 01:29:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2020-11-30 01:29:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 882 transitions. [2020-11-30 01:29:16,099 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 882 transitions. Word has length 186 [2020-11-30 01:29:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:16,100 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 882 transitions. [2020-11-30 01:29:16,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:29:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 882 transitions. [2020-11-30 01:29:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-11-30 01:29:16,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:16,104 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:16,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:29:16,105 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1150685691, now seen corresponding path program 1 times [2020-11-30 01:29:16,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:16,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484144798] [2020-11-30 01:29:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-30 01:29:16,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484144798] [2020-11-30 01:29:16,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128108462] [2020-11-30 01:29:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:16,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:29:16,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:17,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:29:17,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2020-11-30 01:29:17,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964747172] [2020-11-30 01:29:17,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:29:17,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:29:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:29:17,024 INFO L87 Difference]: Start difference. First operand 672 states and 882 transitions. Second operand 9 states. [2020-11-30 01:29:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:18,779 INFO L93 Difference]: Finished difference Result 2347 states and 3155 transitions. [2020-11-30 01:29:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 01:29:18,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2020-11-30 01:29:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:18,804 INFO L225 Difference]: With dead ends: 2347 [2020-11-30 01:29:18,810 INFO L226 Difference]: Without dead ends: 1989 [2020-11-30 01:29:18,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=1856, Unknown=0, NotChecked=0, Total=2256 [2020-11-30 01:29:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2020-11-30 01:29:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 776. [2020-11-30 01:29:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-11-30 01:29:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1012 transitions. [2020-11-30 01:29:18,892 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1012 transitions. Word has length 191 [2020-11-30 01:29:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:18,893 INFO L481 AbstractCegarLoop]: Abstraction has 776 states and 1012 transitions. [2020-11-30 01:29:18,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:29:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1012 transitions. [2020-11-30 01:29:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-11-30 01:29:18,896 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:18,897 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:19,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:29:19,112 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 872323197, now seen corresponding path program 1 times [2020-11-30 01:29:19,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:19,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354142771] [2020-11-30 01:29:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:19,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354142771] [2020-11-30 01:29:19,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:19,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:29:19,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263123446] [2020-11-30 01:29:19,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:29:19,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:29:19,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:19,305 INFO L87 Difference]: Start difference. First operand 776 states and 1012 transitions. Second operand 6 states. [2020-11-30 01:29:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:19,567 INFO L93 Difference]: Finished difference Result 2538 states and 3433 transitions. [2020-11-30 01:29:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:29:19,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2020-11-30 01:29:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:19,592 INFO L225 Difference]: With dead ends: 2538 [2020-11-30 01:29:19,592 INFO L226 Difference]: Without dead ends: 2070 [2020-11-30 01:29:19,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:29:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2020-11-30 01:29:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 853. [2020-11-30 01:29:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-11-30 01:29:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1110 transitions. [2020-11-30 01:29:19,725 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1110 transitions. Word has length 197 [2020-11-30 01:29:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:19,726 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1110 transitions. [2020-11-30 01:29:19,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:29:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1110 transitions. [2020-11-30 01:29:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-11-30 01:29:19,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:19,731 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:19,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 01:29:19,731 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:19,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1630646077, now seen corresponding path program 1 times [2020-11-30 01:29:19,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:19,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192466843] [2020-11-30 01:29:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:19,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192466843] [2020-11-30 01:29:19,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:19,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:29:19,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85804540] [2020-11-30 01:29:19,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:29:19,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:29:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:29:19,997 INFO L87 Difference]: Start difference. First operand 853 states and 1110 transitions. Second operand 7 states. [2020-11-30 01:29:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:20,595 INFO L93 Difference]: Finished difference Result 1994 states and 2626 transitions. [2020-11-30 01:29:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:29:20,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2020-11-30 01:29:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:20,601 INFO L225 Difference]: With dead ends: 1994 [2020-11-30 01:29:20,602 INFO L226 Difference]: Without dead ends: 1452 [2020-11-30 01:29:20,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:29:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-11-30 01:29:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 908. [2020-11-30 01:29:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2020-11-30 01:29:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1170 transitions. [2020-11-30 01:29:20,699 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1170 transitions. Word has length 197 [2020-11-30 01:29:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:20,700 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1170 transitions. [2020-11-30 01:29:20,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:29:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1170 transitions. [2020-11-30 01:29:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-11-30 01:29:20,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:20,704 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:29:20,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 01:29:20,705 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -91486855, now seen corresponding path program 1 times [2020-11-30 01:29:20,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:20,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499389717] [2020-11-30 01:29:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:20,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499389717] [2020-11-30 01:29:20,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:20,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:29:20,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745116025] [2020-11-30 01:29:20,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:29:20,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:29:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:29:20,892 INFO L87 Difference]: Start difference. First operand 908 states and 1170 transitions. Second operand 7 states. [2020-11-30 01:29:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:21,537 INFO L93 Difference]: Finished difference Result 2092 states and 2734 transitions. [2020-11-30 01:29:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:29:21,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2020-11-30 01:29:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:21,543 INFO L225 Difference]: With dead ends: 2092 [2020-11-30 01:29:21,543 INFO L226 Difference]: Without dead ends: 1490 [2020-11-30 01:29:21,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:29:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-11-30 01:29:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 941. [2020-11-30 01:29:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2020-11-30 01:29:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1208 transitions. [2020-11-30 01:29:21,656 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1208 transitions. Word has length 197 [2020-11-30 01:29:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:21,657 INFO L481 AbstractCegarLoop]: Abstraction has 941 states and 1208 transitions. [2020-11-30 01:29:21,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:29:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1208 transitions. [2020-11-30 01:29:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-30 01:29:21,661 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:21,662 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:21,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 01:29:21,663 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 150538126, now seen corresponding path program 1 times [2020-11-30 01:29:21,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:21,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501710867] [2020-11-30 01:29:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-11-30 01:29:21,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501710867] [2020-11-30 01:29:21,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:21,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:21,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601470682] [2020-11-30 01:29:21,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:29:21,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:29:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:29:21,783 INFO L87 Difference]: Start difference. First operand 941 states and 1208 transitions. Second operand 4 states. [2020-11-30 01:29:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:22,089 INFO L93 Difference]: Finished difference Result 1679 states and 2189 transitions. [2020-11-30 01:29:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:22,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2020-11-30 01:29:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:22,093 INFO L225 Difference]: With dead ends: 1679 [2020-11-30 01:29:22,093 INFO L226 Difference]: Without dead ends: 1038 [2020-11-30 01:29:22,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2020-11-30 01:29:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 727. [2020-11-30 01:29:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-11-30 01:29:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 923 transitions. [2020-11-30 01:29:22,176 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 923 transitions. Word has length 207 [2020-11-30 01:29:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:22,177 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 923 transitions. [2020-11-30 01:29:22,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:29:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 923 transitions. [2020-11-30 01:29:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-11-30 01:29:22,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:22,182 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:22,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-30 01:29:22,183 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 917837052, now seen corresponding path program 1 times [2020-11-30 01:29:22,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:22,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034864017] [2020-11-30 01:29:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:22,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034864017] [2020-11-30 01:29:22,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704151398] [2020-11-30 01:29:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:22,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:29:22,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:23,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:23,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 01:29:23,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103150415] [2020-11-30 01:29:23,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 01:29:23,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 01:29:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:29:23,430 INFO L87 Difference]: Start difference. First operand 727 states and 923 transitions. Second operand 21 states. [2020-11-30 01:29:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:28,311 INFO L93 Difference]: Finished difference Result 5755 states and 7616 transitions. [2020-11-30 01:29:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 01:29:28,312 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 231 [2020-11-30 01:29:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:28,324 INFO L225 Difference]: With dead ends: 5755 [2020-11-30 01:29:28,324 INFO L226 Difference]: Without dead ends: 5347 [2020-11-30 01:29:28,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1884, Invalid=8216, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 01:29:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2020-11-30 01:29:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 1638. [2020-11-30 01:29:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-11-30 01:29:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2111 transitions. [2020-11-30 01:29:28,572 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2111 transitions. Word has length 231 [2020-11-30 01:29:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:28,573 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2111 transitions. [2020-11-30 01:29:28,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 01:29:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2111 transitions. [2020-11-30 01:29:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-11-30 01:29:28,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:28,580 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:28,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-30 01:29:28,797 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash -701137862, now seen corresponding path program 1 times [2020-11-30 01:29:28,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:28,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337360722] [2020-11-30 01:29:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-11-30 01:29:29,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337360722] [2020-11-30 01:29:29,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:29,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:29,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458897556] [2020-11-30 01:29:29,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:29:29,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:29,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:29:29,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:29,092 INFO L87 Difference]: Start difference. First operand 1638 states and 2111 transitions. Second operand 5 states. [2020-11-30 01:29:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:29,392 INFO L93 Difference]: Finished difference Result 2955 states and 3833 transitions. [2020-11-30 01:29:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:29,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2020-11-30 01:29:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:29,397 INFO L225 Difference]: With dead ends: 2955 [2020-11-30 01:29:29,397 INFO L226 Difference]: Without dead ends: 1638 [2020-11-30 01:29:29,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-11-30 01:29:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-11-30 01:29:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-11-30 01:29:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2108 transitions. [2020-11-30 01:29:29,611 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2108 transitions. Word has length 231 [2020-11-30 01:29:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:29,611 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2108 transitions. [2020-11-30 01:29:29,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:29:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2108 transitions. [2020-11-30 01:29:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-30 01:29:29,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:29,617 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:29,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-30 01:29:29,618 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:29,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1875897740, now seen corresponding path program 1 times [2020-11-30 01:29:29,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:29,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555132675] [2020-11-30 01:29:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:30,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555132675] [2020-11-30 01:29:30,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870749228] [2020-11-30 01:29:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:30,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 01:29:30,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:30,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:30,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 01:29:30,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045732672] [2020-11-30 01:29:30,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:29:30,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:29:30,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:29:30,884 INFO L87 Difference]: Start difference. First operand 1638 states and 2108 transitions. Second operand 22 states. [2020-11-30 01:29:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:38,284 INFO L93 Difference]: Finished difference Result 16996 states and 22344 transitions. [2020-11-30 01:29:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-11-30 01:29:38,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 232 [2020-11-30 01:29:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:38,326 INFO L225 Difference]: With dead ends: 16996 [2020-11-30 01:29:38,326 INFO L226 Difference]: Without dead ends: 15793 [2020-11-30 01:29:38,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6306 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2817, Invalid=13695, Unknown=0, NotChecked=0, Total=16512 [2020-11-30 01:29:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15793 states. [2020-11-30 01:29:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15793 to 3452. [2020-11-30 01:29:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-30 01:29:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4528 transitions. [2020-11-30 01:29:38,889 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4528 transitions. Word has length 232 [2020-11-30 01:29:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:38,890 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4528 transitions. [2020-11-30 01:29:38,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:29:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4528 transitions. [2020-11-30 01:29:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-30 01:29:38,902 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:38,902 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:39,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-11-30 01:29:39,129 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1648335990, now seen corresponding path program 1 times [2020-11-30 01:29:39,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:39,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784917064] [2020-11-30 01:29:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-30 01:29:39,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784917064] [2020-11-30 01:29:39,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:39,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:39,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674934511] [2020-11-30 01:29:39,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:29:39,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:29:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:39,473 INFO L87 Difference]: Start difference. First operand 3452 states and 4528 transitions. Second operand 5 states. [2020-11-30 01:29:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:39,946 INFO L93 Difference]: Finished difference Result 6463 states and 8519 transitions. [2020-11-30 01:29:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:39,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2020-11-30 01:29:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:39,955 INFO L225 Difference]: With dead ends: 6463 [2020-11-30 01:29:39,955 INFO L226 Difference]: Without dead ends: 3452 [2020-11-30 01:29:39,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2020-11-30 01:29:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2020-11-30 01:29:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-30 01:29:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4513 transitions. [2020-11-30 01:29:40,299 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4513 transitions. Word has length 232 [2020-11-30 01:29:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:40,300 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4513 transitions. [2020-11-30 01:29:40,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:29:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4513 transitions. [2020-11-30 01:29:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-30 01:29:40,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:40,309 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:40,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-30 01:29:40,310 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash -575374646, now seen corresponding path program 1 times [2020-11-30 01:29:40,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:40,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930440782] [2020-11-30 01:29:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:40,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930440782] [2020-11-30 01:29:40,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398885557] [2020-11-30 01:29:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:41,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:29:41,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:41,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:41,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 01:29:41,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644194614] [2020-11-30 01:29:41,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 01:29:41,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 01:29:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:29:41,523 INFO L87 Difference]: Start difference. First operand 3452 states and 4513 transitions. Second operand 21 states. [2020-11-30 01:29:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:48,574 INFO L93 Difference]: Finished difference Result 25608 states and 34191 transitions. [2020-11-30 01:29:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 01:29:48,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 232 [2020-11-30 01:29:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:48,613 INFO L225 Difference]: With dead ends: 25608 [2020-11-30 01:29:48,613 INFO L226 Difference]: Without dead ends: 22775 [2020-11-30 01:29:48,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 01:29:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22775 states. [2020-11-30 01:29:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22775 to 3462. [2020-11-30 01:29:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-11-30 01:29:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4528 transitions. [2020-11-30 01:29:49,316 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4528 transitions. Word has length 232 [2020-11-30 01:29:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:49,317 INFO L481 AbstractCegarLoop]: Abstraction has 3462 states and 4528 transitions. [2020-11-30 01:29:49,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 01:29:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4528 transitions. [2020-11-30 01:29:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-30 01:29:49,324 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:49,324 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:49,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:29:49,526 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2100617736, now seen corresponding path program 1 times [2020-11-30 01:29:49,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:49,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309715742] [2020-11-30 01:29:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2020-11-30 01:29:49,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309715742] [2020-11-30 01:29:49,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:29:49,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:29:49,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935581854] [2020-11-30 01:29:49,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:29:49,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:29:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:49,779 INFO L87 Difference]: Start difference. First operand 3462 states and 4528 transitions. Second operand 5 states. [2020-11-30 01:29:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:29:50,518 INFO L93 Difference]: Finished difference Result 6500 states and 8544 transitions. [2020-11-30 01:29:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:29:50,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2020-11-30 01:29:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:29:50,524 INFO L225 Difference]: With dead ends: 6500 [2020-11-30 01:29:50,524 INFO L226 Difference]: Without dead ends: 3467 [2020-11-30 01:29:50,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:29:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2020-11-30 01:29:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3452. [2020-11-30 01:29:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-30 01:29:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4513 transitions. [2020-11-30 01:29:50,981 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4513 transitions. Word has length 232 [2020-11-30 01:29:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:29:50,981 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4513 transitions. [2020-11-30 01:29:50,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:29:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4513 transitions. [2020-11-30 01:29:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-30 01:29:50,989 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:29:50,989 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:29:50,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-30 01:29:50,990 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:29:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:29:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -557351621, now seen corresponding path program 1 times [2020-11-30 01:29:50,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:29:50,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003856661] [2020-11-30 01:29:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:29:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:51,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003856661] [2020-11-30 01:29:51,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385167968] [2020-11-30 01:29:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:29:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:29:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 01:29:51,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:29:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:29:52,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:52,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 01:29:52,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681108003] [2020-11-30 01:29:52,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:29:52,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:29:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:29:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:29:52,208 INFO L87 Difference]: Start difference. First operand 3452 states and 4513 transitions. Second operand 22 states. [2020-11-30 01:30:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:01,860 INFO L93 Difference]: Finished difference Result 27505 states and 36496 transitions. [2020-11-30 01:30:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-11-30 01:30:01,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 233 [2020-11-30 01:30:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:01,891 INFO L225 Difference]: With dead ends: 27505 [2020-11-30 01:30:01,891 INFO L226 Difference]: Without dead ends: 24672 [2020-11-30 01:30:01,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6092 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2809, Invalid=13703, Unknown=0, NotChecked=0, Total=16512 [2020-11-30 01:30:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2020-11-30 01:30:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 3482. [2020-11-30 01:30:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2020-11-30 01:30:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4558 transitions. [2020-11-30 01:30:02,666 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4558 transitions. Word has length 233 [2020-11-30 01:30:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:02,669 INFO L481 AbstractCegarLoop]: Abstraction has 3482 states and 4558 transitions. [2020-11-30 01:30:02,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:30:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4558 transitions. [2020-11-30 01:30:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-30 01:30:02,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:02,678 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:02,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:30:02,896 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1328085187, now seen corresponding path program 1 times [2020-11-30 01:30:02,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:02,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861649508] [2020-11-30 01:30:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-30 01:30:03,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861649508] [2020-11-30 01:30:03,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:03,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:30:03,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328170923] [2020-11-30 01:30:03,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:30:03,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:30:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:03,154 INFO L87 Difference]: Start difference. First operand 3482 states and 4558 transitions. Second operand 5 states. [2020-11-30 01:30:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:03,680 INFO L93 Difference]: Finished difference Result 6532 states and 8588 transitions. [2020-11-30 01:30:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:30:03,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2020-11-30 01:30:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:03,687 INFO L225 Difference]: With dead ends: 6532 [2020-11-30 01:30:03,687 INFO L226 Difference]: Without dead ends: 3497 [2020-11-30 01:30:03,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2020-11-30 01:30:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3452. [2020-11-30 01:30:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-30 01:30:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4513 transitions. [2020-11-30 01:30:04,332 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4513 transitions. Word has length 233 [2020-11-30 01:30:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:04,333 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4513 transitions. [2020-11-30 01:30:04,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:30:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4513 transitions. [2020-11-30 01:30:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-30 01:30:04,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:04,340 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:04,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-30 01:30:04,341 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:04,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1494513859, now seen corresponding path program 1 times [2020-11-30 01:30:04,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:04,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981329731] [2020-11-30 01:30:04,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-11-30 01:30:04,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981329731] [2020-11-30 01:30:04,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11353281] [2020-11-30 01:30:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:30:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:04,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:30:04,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:05,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:30:05,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-30 01:30:05,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600270852] [2020-11-30 01:30:05,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 01:30:05,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 01:30:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:30:05,188 INFO L87 Difference]: Start difference. First operand 3452 states and 4513 transitions. Second operand 15 states. [2020-11-30 01:30:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:14,267 INFO L93 Difference]: Finished difference Result 27311 states and 36334 transitions. [2020-11-30 01:30:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2020-11-30 01:30:14,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 233 [2020-11-30 01:30:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:14,290 INFO L225 Difference]: With dead ends: 27311 [2020-11-30 01:30:14,291 INFO L226 Difference]: Without dead ends: 24276 [2020-11-30 01:30:14,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6233 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1592, Invalid=15438, Unknown=0, NotChecked=0, Total=17030 [2020-11-30 01:30:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24276 states. [2020-11-30 01:30:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24276 to 5467. [2020-11-30 01:30:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2020-11-30 01:30:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 6911 transitions. [2020-11-30 01:30:15,329 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 6911 transitions. Word has length 233 [2020-11-30 01:30:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:15,329 INFO L481 AbstractCegarLoop]: Abstraction has 5467 states and 6911 transitions. [2020-11-30 01:30:15,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 01:30:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 6911 transitions. [2020-11-30 01:30:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-30 01:30:15,338 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:15,339 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:15,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-11-30 01:30:15,540 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1929881731, now seen corresponding path program 1 times [2020-11-30 01:30:15,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:15,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180349852] [2020-11-30 01:30:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-11-30 01:30:15,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180349852] [2020-11-30 01:30:15,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:15,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:30:15,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788100207] [2020-11-30 01:30:15,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:30:15,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:30:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:30:15,723 INFO L87 Difference]: Start difference. First operand 5467 states and 6911 transitions. Second operand 3 states. [2020-11-30 01:30:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:16,719 INFO L93 Difference]: Finished difference Result 10760 states and 13578 transitions. [2020-11-30 01:30:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:30:16,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2020-11-30 01:30:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:16,728 INFO L225 Difference]: With dead ends: 10760 [2020-11-30 01:30:16,728 INFO L226 Difference]: Without dead ends: 6058 [2020-11-30 01:30:16,734 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-30 01:30:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-11-30 01:30:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 5419. [2020-11-30 01:30:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2020-11-30 01:30:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 6617 transitions. [2020-11-30 01:30:17,957 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 6617 transitions. Word has length 233 [2020-11-30 01:30:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:17,957 INFO L481 AbstractCegarLoop]: Abstraction has 5419 states and 6617 transitions. [2020-11-30 01:30:17,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:30:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 6617 transitions. [2020-11-30 01:30:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-11-30 01:30:17,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:17,967 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:17,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-30 01:30:17,968 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1195234806, now seen corresponding path program 1 times [2020-11-30 01:30:17,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:17,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682444245] [2020-11-30 01:30:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-30 01:30:18,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682444245] [2020-11-30 01:30:18,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:18,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:30:18,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75966544] [2020-11-30 01:30:18,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:30:18,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:18,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:30:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:30:18,095 INFO L87 Difference]: Start difference. First operand 5419 states and 6617 transitions. Second operand 3 states. [2020-11-30 01:30:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:19,218 INFO L93 Difference]: Finished difference Result 10431 states and 12734 transitions. [2020-11-30 01:30:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:30:19,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2020-11-30 01:30:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:19,223 INFO L225 Difference]: With dead ends: 10431 [2020-11-30 01:30:19,224 INFO L226 Difference]: Without dead ends: 5025 [2020-11-30 01:30:19,228 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-30 01:30:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2020-11-30 01:30:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 5025. [2020-11-30 01:30:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2020-11-30 01:30:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 6123 transitions. [2020-11-30 01:30:20,019 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 6123 transitions. Word has length 242 [2020-11-30 01:30:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:20,019 INFO L481 AbstractCegarLoop]: Abstraction has 5025 states and 6123 transitions. [2020-11-30 01:30:20,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:30:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 6123 transitions. [2020-11-30 01:30:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-30 01:30:20,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:20,027 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:20,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-30 01:30:20,028 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash 492124221, now seen corresponding path program 1 times [2020-11-30 01:30:20,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:20,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566901414] [2020-11-30 01:30:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:20,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566901414] [2020-11-30 01:30:20,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687051827] [2020-11-30 01:30:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:30:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:20,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:30:20,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:21,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:30:21,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-11-30 01:30:21,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869212242] [2020-11-30 01:30:21,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:30:21,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:30:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:30:21,063 INFO L87 Difference]: Start difference. First operand 5025 states and 6123 transitions. Second operand 8 states. [2020-11-30 01:30:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:26,345 INFO L93 Difference]: Finished difference Result 26408 states and 32852 transitions. [2020-11-30 01:30:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 01:30:26,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2020-11-30 01:30:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:26,372 INFO L225 Difference]: With dead ends: 26408 [2020-11-30 01:30:26,373 INFO L226 Difference]: Without dead ends: 22006 [2020-11-30 01:30:26,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 01:30:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22006 states. [2020-11-30 01:30:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22006 to 11348. [2020-11-30 01:30:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11348 states. [2020-11-30 01:30:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11348 states to 11348 states and 13781 transitions. [2020-11-30 01:30:28,456 INFO L78 Accepts]: Start accepts. Automaton has 11348 states and 13781 transitions. Word has length 245 [2020-11-30 01:30:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:28,457 INFO L481 AbstractCegarLoop]: Abstraction has 11348 states and 13781 transitions. [2020-11-30 01:30:28,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:30:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11348 states and 13781 transitions. [2020-11-30 01:30:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-30 01:30:28,471 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:28,472 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:28,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-11-30 01:30:28,677 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2122411545, now seen corresponding path program 1 times [2020-11-30 01:30:28,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:28,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573726696] [2020-11-30 01:30:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:29,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573726696] [2020-11-30 01:30:29,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814498193] [2020-11-30 01:30:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:30:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:29,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:30:29,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:29,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:30:29,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-11-30 01:30:29,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104560804] [2020-11-30 01:30:29,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 01:30:29,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 01:30:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:30:29,959 INFO L87 Difference]: Start difference. First operand 11348 states and 13781 transitions. Second operand 21 states. [2020-11-30 01:30:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:44,219 INFO L93 Difference]: Finished difference Result 64061 states and 79646 transitions. [2020-11-30 01:30:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-11-30 01:30:44,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 245 [2020-11-30 01:30:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:44,280 INFO L225 Difference]: With dead ends: 64061 [2020-11-30 01:30:44,281 INFO L226 Difference]: Without dead ends: 53562 [2020-11-30 01:30:44,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3451 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1877, Invalid=8223, Unknown=0, NotChecked=0, Total=10100 [2020-11-30 01:30:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53562 states. [2020-11-30 01:30:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53562 to 11370. [2020-11-30 01:30:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2020-11-30 01:30:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 13814 transitions. [2020-11-30 01:30:46,844 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 13814 transitions. Word has length 245 [2020-11-30 01:30:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:46,845 INFO L481 AbstractCegarLoop]: Abstraction has 11370 states and 13814 transitions. [2020-11-30 01:30:46,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 01:30:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 13814 transitions. [2020-11-30 01:30:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-30 01:30:46,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:46,865 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:47,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-11-30 01:30:47,067 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1549274149, now seen corresponding path program 1 times [2020-11-30 01:30:47,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:47,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392328379] [2020-11-30 01:30:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-11-30 01:30:47,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392328379] [2020-11-30 01:30:47,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:47,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:30:47,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919378547] [2020-11-30 01:30:47,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:30:47,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:30:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:47,542 INFO L87 Difference]: Start difference. First operand 11370 states and 13814 transitions. Second operand 5 states. [2020-11-30 01:30:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:49,832 INFO L93 Difference]: Finished difference Result 22114 states and 26930 transitions. [2020-11-30 01:30:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:30:49,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2020-11-30 01:30:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:49,844 INFO L225 Difference]: With dead ends: 22114 [2020-11-30 01:30:49,844 INFO L226 Difference]: Without dead ends: 11381 [2020-11-30 01:30:49,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:30:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2020-11-30 01:30:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 11348. [2020-11-30 01:30:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11348 states. [2020-11-30 01:30:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11348 states to 11348 states and 13781 transitions. [2020-11-30 01:30:52,077 INFO L78 Accepts]: Start accepts. Automaton has 11348 states and 13781 transitions. Word has length 245 [2020-11-30 01:30:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:52,077 INFO L481 AbstractCegarLoop]: Abstraction has 11348 states and 13781 transitions. [2020-11-30 01:30:52,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:30:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11348 states and 13781 transitions. [2020-11-30 01:30:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-30 01:30:52,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:52,088 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:30:52,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-30 01:30:52,088 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 199390373, now seen corresponding path program 1 times [2020-11-30 01:30:52,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:52,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997144516] [2020-11-30 01:30:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-11-30 01:30:52,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997144516] [2020-11-30 01:30:52,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:30:52,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:30:52,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891075242] [2020-11-30 01:30:52,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:30:52,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:30:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:30:52,244 INFO L87 Difference]: Start difference. First operand 11348 states and 13781 transitions. Second operand 3 states. [2020-11-30 01:30:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:53,718 INFO L93 Difference]: Finished difference Result 17147 states and 20863 transitions. [2020-11-30 01:30:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:30:53,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2020-11-30 01:30:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:53,725 INFO L225 Difference]: With dead ends: 17147 [2020-11-30 01:30:53,725 INFO L226 Difference]: Without dead ends: 6425 [2020-11-30 01:30:53,730 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-30 01:30:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6425 states. [2020-11-30 01:30:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6425 to 6425. [2020-11-30 01:30:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6425 states. [2020-11-30 01:30:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 7770 transitions. [2020-11-30 01:30:55,087 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 7770 transitions. Word has length 245 [2020-11-30 01:30:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:55,087 INFO L481 AbstractCegarLoop]: Abstraction has 6425 states and 7770 transitions. [2020-11-30 01:30:55,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:30:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 7770 transitions. [2020-11-30 01:30:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 01:30:55,093 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:55,093 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:30:55,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-30 01:30:55,094 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -276317944, now seen corresponding path program 1 times [2020-11-30 01:30:55,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:30:55,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720999367] [2020-11-30 01:30:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:30:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:55,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720999367] [2020-11-30 01:30:55,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656289646] [2020-11-30 01:30:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:30:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:30:55,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 01:30:55,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:30:55,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:30:55,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2020-11-30 01:30:55,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627650857] [2020-11-30 01:30:55,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:30:55,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:30:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:30:55,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:30:55,836 INFO L87 Difference]: Start difference. First operand 6425 states and 7770 transitions. Second operand 13 states. [2020-11-30 01:31:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:11,068 INFO L93 Difference]: Finished difference Result 44397 states and 57054 transitions. [2020-11-30 01:31:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2020-11-30 01:31:11,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 246 [2020-11-30 01:31:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:11,104 INFO L225 Difference]: With dead ends: 44397 [2020-11-30 01:31:11,104 INFO L226 Difference]: Without dead ends: 38605 [2020-11-30 01:31:11,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4145 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1863, Invalid=9267, Unknown=0, NotChecked=0, Total=11130 [2020-11-30 01:31:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38605 states. [2020-11-30 01:31:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38605 to 11662. [2020-11-30 01:31:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11662 states. [2020-11-30 01:31:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11662 states to 11662 states and 14158 transitions. [2020-11-30 01:31:14,059 INFO L78 Accepts]: Start accepts. Automaton has 11662 states and 14158 transitions. Word has length 246 [2020-11-30 01:31:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:14,059 INFO L481 AbstractCegarLoop]: Abstraction has 11662 states and 14158 transitions. [2020-11-30 01:31:14,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:31:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11662 states and 14158 transitions. [2020-11-30 01:31:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 01:31:14,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:14,066 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:14,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:14,267 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1509415443, now seen corresponding path program 1 times [2020-11-30 01:31:14,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:14,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978728374] [2020-11-30 01:31:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 01:31:14,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978728374] [2020-11-30 01:31:14,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487418843] [2020-11-30 01:31:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:31:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:15,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:31:15,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 01:31:15,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:31:15,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2020-11-30 01:31:15,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051275322] [2020-11-30 01:31:15,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:31:15,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:31:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:31:15,156 INFO L87 Difference]: Start difference. First operand 11662 states and 14158 transitions. Second operand 7 states. [2020-11-30 01:31:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:24,893 INFO L93 Difference]: Finished difference Result 42993 states and 52803 transitions. [2020-11-30 01:31:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:31:24,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 246 [2020-11-30 01:31:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:24,926 INFO L225 Difference]: With dead ends: 42993 [2020-11-30 01:31:24,927 INFO L226 Difference]: Without dead ends: 31964 [2020-11-30 01:31:24,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-11-30 01:31:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31964 states. [2020-11-30 01:31:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31964 to 7095. [2020-11-30 01:31:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7095 states. [2020-11-30 01:31:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7095 states to 7095 states and 8538 transitions. [2020-11-30 01:31:26,924 INFO L78 Accepts]: Start accepts. Automaton has 7095 states and 8538 transitions. Word has length 246 [2020-11-30 01:31:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:26,925 INFO L481 AbstractCegarLoop]: Abstraction has 7095 states and 8538 transitions. [2020-11-30 01:31:26,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:31:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7095 states and 8538 transitions. [2020-11-30 01:31:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 01:31:26,932 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:26,932 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:27,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2020-11-30 01:31:27,153 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2003378663, now seen corresponding path program 1 times [2020-11-30 01:31:27,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:27,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25012426] [2020-11-30 01:31:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:31:27,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25012426] [2020-11-30 01:31:27,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47369176] [2020-11-30 01:31:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:31:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:28,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 01:31:28,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-11-30 01:31:28,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:28,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 01:31:28,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393652716] [2020-11-30 01:31:28,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:31:28,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:31:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:31:28,679 INFO L87 Difference]: Start difference. First operand 7095 states and 8538 transitions. Second operand 22 states. [2020-11-30 01:31:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:52,504 INFO L93 Difference]: Finished difference Result 60035 states and 73684 transitions. [2020-11-30 01:31:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2020-11-30 01:31:52,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 246 [2020-11-30 01:31:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:52,596 INFO L225 Difference]: With dead ends: 60035 [2020-11-30 01:31:52,596 INFO L226 Difference]: Without dead ends: 53460 [2020-11-30 01:31:52,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6132 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2809, Invalid=13703, Unknown=0, NotChecked=0, Total=16512 [2020-11-30 01:31:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53460 states. [2020-11-30 01:31:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53460 to 7139. [2020-11-30 01:31:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7139 states. [2020-11-30 01:31:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 8604 transitions. [2020-11-30 01:31:55,169 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 8604 transitions. Word has length 246 [2020-11-30 01:31:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:55,169 INFO L481 AbstractCegarLoop]: Abstraction has 7139 states and 8604 transitions. [2020-11-30 01:31:55,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:31:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 8604 transitions. [2020-11-30 01:31:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 01:31:55,174 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:55,174 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:55,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:55,375 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 984446235, now seen corresponding path program 1 times [2020-11-30 01:31:55,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:55,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083744107] [2020-11-30 01:31:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-30 01:31:55,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083744107] [2020-11-30 01:31:55,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:55,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:55,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307769227] [2020-11-30 01:31:55,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:55,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:55,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:55,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:55,699 INFO L87 Difference]: Start difference. First operand 7139 states and 8604 transitions. Second operand 5 states. [2020-11-30 01:31:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:58,213 INFO L93 Difference]: Finished difference Result 13966 states and 16856 transitions. [2020-11-30 01:31:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:58,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2020-11-30 01:31:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:58,225 INFO L225 Difference]: With dead ends: 13966 [2020-11-30 01:31:58,225 INFO L226 Difference]: Without dead ends: 7161 [2020-11-30 01:31:58,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2020-11-30 01:32:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7095. [2020-11-30 01:32:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7095 states. [2020-11-30 01:32:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7095 states to 7095 states and 8538 transitions. [2020-11-30 01:32:00,411 INFO L78 Accepts]: Start accepts. Automaton has 7095 states and 8538 transitions. Word has length 246 [2020-11-30 01:32:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:00,412 INFO L481 AbstractCegarLoop]: Abstraction has 7095 states and 8538 transitions. [2020-11-30 01:32:00,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:32:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7095 states and 8538 transitions. [2020-11-30 01:32:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-11-30 01:32:00,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:00,416 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:00,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-30 01:32:00,417 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 258194587, now seen corresponding path program 1 times [2020-11-30 01:32:00,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:00,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054362551] [2020-11-30 01:32:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-30 01:32:00,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054362551] [2020-11-30 01:32:00,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:00,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:32:00,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676685078] [2020-11-30 01:32:00,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:32:00,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:32:00,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:32:00,551 INFO L87 Difference]: Start difference. First operand 7095 states and 8538 transitions. Second operand 3 states. [2020-11-30 01:32:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:02,288 INFO L93 Difference]: Finished difference Result 10969 states and 13206 transitions. [2020-11-30 01:32:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:32:02,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2020-11-30 01:32:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:02,293 INFO L225 Difference]: With dead ends: 10969 [2020-11-30 01:32:02,293 INFO L226 Difference]: Without dead ends: 4184 [2020-11-30 01:32:02,297 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-30 01:32:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2020-11-30 01:32:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4184. [2020-11-30 01:32:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2020-11-30 01:32:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4996 transitions. [2020-11-30 01:32:03,951 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4996 transitions. Word has length 246 [2020-11-30 01:32:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:03,951 INFO L481 AbstractCegarLoop]: Abstraction has 4184 states and 4996 transitions. [2020-11-30 01:32:03,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:32:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4996 transitions. [2020-11-30 01:32:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-11-30 01:32:03,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:03,954 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:32:03,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-30 01:32:03,955 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash 253457899, now seen corresponding path program 1 times [2020-11-30 01:32:03,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:03,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377652771] [2020-11-30 01:32:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 01:32:04,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377652771] [2020-11-30 01:32:04,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:04,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:32:04,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280807808] [2020-11-30 01:32:04,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:32:04,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:04,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:32:04,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:32:04,137 INFO L87 Difference]: Start difference. First operand 4184 states and 4996 transitions. Second operand 7 states. [2020-11-30 01:32:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:07,675 INFO L93 Difference]: Finished difference Result 9998 states and 12180 transitions. [2020-11-30 01:32:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:32:07,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2020-11-30 01:32:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:07,682 INFO L225 Difference]: With dead ends: 9998 [2020-11-30 01:32:07,682 INFO L226 Difference]: Without dead ends: 6254 [2020-11-30 01:32:07,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:32:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2020-11-30 01:32:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 4724. [2020-11-30 01:32:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2020-11-30 01:32:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 5684 transitions. [2020-11-30 01:32:09,343 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 5684 transitions. Word has length 250 [2020-11-30 01:32:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:09,343 INFO L481 AbstractCegarLoop]: Abstraction has 4724 states and 5684 transitions. [2020-11-30 01:32:09,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:32:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 5684 transitions. [2020-11-30 01:32:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-30 01:32:09,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:09,346 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:32:09,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-30 01:32:09,347 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -340514330, now seen corresponding path program 1 times [2020-11-30 01:32:09,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:09,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169481430] [2020-11-30 01:32:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-11-30 01:32:09,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169481430] [2020-11-30 01:32:09,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:09,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:32:09,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710762661] [2020-11-30 01:32:09,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:32:09,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:09,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:32:09,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:32:09,521 INFO L87 Difference]: Start difference. First operand 4724 states and 5684 transitions. Second operand 7 states. [2020-11-30 01:32:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:12,481 INFO L93 Difference]: Finished difference Result 10430 states and 12660 transitions. [2020-11-30 01:32:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:32:12,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2020-11-30 01:32:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:12,488 INFO L225 Difference]: With dead ends: 10430 [2020-11-30 01:32:12,488 INFO L226 Difference]: Without dead ends: 6146 [2020-11-30 01:32:12,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:32:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2020-11-30 01:32:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 4708. [2020-11-30 01:32:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4708 states. [2020-11-30 01:32:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 5660 transitions. [2020-11-30 01:32:14,279 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 5660 transitions. Word has length 252 [2020-11-30 01:32:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:14,279 INFO L481 AbstractCegarLoop]: Abstraction has 4708 states and 5660 transitions. [2020-11-30 01:32:14,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:32:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 5660 transitions. [2020-11-30 01:32:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-30 01:32:14,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:14,284 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:32:14,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-30 01:32:14,285 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 696127142, now seen corresponding path program 1 times [2020-11-30 01:32:14,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:14,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001420079] [2020-11-30 01:32:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 01:32:14,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001420079] [2020-11-30 01:32:14,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488989519] [2020-11-30 01:32:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:32:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:15,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:32:15,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-11-30 01:32:15,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:15,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 01:32:15,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338146821] [2020-11-30 01:32:15,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:32:15,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:32:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:32:15,196 INFO L87 Difference]: Start difference. First operand 4708 states and 5660 transitions. Second operand 10 states. [2020-11-30 01:32:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:18,768 INFO L93 Difference]: Finished difference Result 10844 states and 13156 transitions. [2020-11-30 01:32:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:32:18,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 252 [2020-11-30 01:32:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:18,776 INFO L225 Difference]: With dead ends: 10844 [2020-11-30 01:32:18,776 INFO L226 Difference]: Without dead ends: 6532 [2020-11-30 01:32:18,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:32:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2020-11-30 01:32:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 4708. [2020-11-30 01:32:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4708 states. [2020-11-30 01:32:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 5656 transitions. [2020-11-30 01:32:20,681 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 5656 transitions. Word has length 252 [2020-11-30 01:32:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:20,682 INFO L481 AbstractCegarLoop]: Abstraction has 4708 states and 5656 transitions. [2020-11-30 01:32:20,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:32:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 5656 transitions. [2020-11-30 01:32:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-11-30 01:32:20,685 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:20,685 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:32:20,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-11-30 01:32:20,886 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1990248082, now seen corresponding path program 1 times [2020-11-30 01:32:20,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:20,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166670519] [2020-11-30 01:32:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-30 01:32:21,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166670519] [2020-11-30 01:32:21,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757830267] [2020-11-30 01:32:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/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-30 01:32:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:21,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:32:21,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-30 01:32:21,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:21,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 01:32:21,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489843285] [2020-11-30 01:32:21,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:32:21,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:32:21,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:32:21,740 INFO L87 Difference]: Start difference. First operand 4708 states and 5656 transitions. Second operand 10 states. [2020-11-30 01:32:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:25,436 INFO L93 Difference]: Finished difference Result 11543 states and 14045 transitions. [2020-11-30 01:32:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:32:25,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2020-11-30 01:32:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:25,444 INFO L225 Difference]: With dead ends: 11543 [2020-11-30 01:32:25,444 INFO L226 Difference]: Without dead ends: 7231 [2020-11-30 01:32:25,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:32:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7231 states. [2020-11-30 01:32:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7231 to 4708. [2020-11-30 01:32:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4708 states. [2020-11-30 01:32:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 5652 transitions. [2020-11-30 01:32:27,141 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 5652 transitions. Word has length 259 [2020-11-30 01:32:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:27,141 INFO L481 AbstractCegarLoop]: Abstraction has 4708 states and 5652 transitions. [2020-11-30 01:32:27,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:32:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 5652 transitions. [2020-11-30 01:32:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-11-30 01:32:27,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:27,146 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 01:32:27,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2020-11-30 01:32:27,347 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1431201432, now seen corresponding path program 1 times [2020-11-30 01:32:27,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:27,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952301111] [2020-11-30 01:32:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:27,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:27,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:27,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:27,723 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:32:27,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-11-30 01:32:28,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:32:28 BoogieIcfgContainer [2020-11-30 01:32:28,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:32:28,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:32:28,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:32:28,119 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:32:28,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:29:02" (3/4) ... [2020-11-30 01:32:28,122 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:32:28,536 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bf50c264-cd02-4c42-bd0e-1261a08d8e03/bin/uautomizer/witness.graphml [2020-11-30 01:32:28,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:32:28,538 INFO L168 Benchmark]: Toolchain (without parser) took 209965.82 ms. Allocated memory was 88.1 MB in the beginning and 3.2 GB in the end (delta: 3.2 GB). Free memory was 55.0 MB in the beginning and 2.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 869.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,539 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 88.1 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:32:28,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.92 ms. Allocated memory is still 88.1 MB. Free memory was 54.8 MB in the beginning and 60.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.78 ms. Allocated memory is still 88.1 MB. Free memory was 60.4 MB in the beginning and 53.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,540 INFO L168 Benchmark]: Boogie Preprocessor took 149.38 ms. Allocated memory is still 88.1 MB. Free memory was 53.8 MB in the beginning and 48.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,540 INFO L168 Benchmark]: RCFGBuilder took 2965.36 ms. Allocated memory was 88.1 MB in the beginning and 109.1 MB in the end (delta: 21.0 MB). Free memory was 48.5 MB in the beginning and 66.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,541 INFO L168 Benchmark]: TraceAbstraction took 205787.02 ms. Allocated memory was 109.1 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 66.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 790.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,541 INFO L168 Benchmark]: Witness Printer took 417.80 ms. Allocated memory is still 3.2 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 68.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:28,544 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.45 ms. Allocated memory is still 88.1 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 499.92 ms. Allocated memory is still 88.1 MB. Free memory was 54.8 MB in the beginning and 60.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 137.78 ms. Allocated memory is still 88.1 MB. Free memory was 60.4 MB in the beginning and 53.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 149.38 ms. Allocated memory is still 88.1 MB. Free memory was 53.8 MB in the beginning and 48.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2965.36 ms. Allocated memory was 88.1 MB in the beginning and 109.1 MB in the end (delta: 21.0 MB). Free memory was 48.5 MB in the beginning and 66.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 205787.02 ms. Allocated memory was 109.1 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 66.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 790.6 MB. Max. memory is 16.1 GB. * Witness Printer took 417.80 ms. Allocated memory is still 3.2 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 68.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND TRUE history_id == 0 [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND TRUE history_id == 1 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND TRUE history_id == 2 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L90] COND TRUE history_id == 3 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L96] var ++ VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L98] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=2, gate1Failed_History_0=0, gate1Failed_History_1=5, gate1Failed_History_2=3, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L346] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=6, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=9, gate2Failed_History_2=10, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=8, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=-3, VALUE3=-5, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L127] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L137] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L147] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L107] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L333] return (1); VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L520] c1 = check() [L533] COND FALSE !(! arg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L522] i2 ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=5, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L508] COND TRUE i2 < 10 [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=9, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L181] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L186] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 [L106] COND TRUE history_id == 3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg [L126] COND TRUE history_id == 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) [L126] COND FALSE !(history_id == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] c1 = check() [L533] COND TRUE ! arg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L3] __assert_fail("0", "pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c", 3, "reach_error") VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 555 locations, 37 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 205.3s, OverallIterations: 62, TraceHistogramMax: 3, AutomataDifference: 141.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31920 SDtfs, 55201 SDslu, 129729 SDs, 0 SdLazy, 24994 SolverSat, 1435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4973 GetRequests, 3772 SyntacticMatches, 4 SemanticMatches, 1197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40640 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11662occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 246980 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 14174 NumberOfCodeBlocks, 14174 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 13820 ConstructedInterpolants, 0 QuantifiedInterpolants, 9599233 SizeOfPredicates, 111 NumberOfNonLiveVariables, 15658 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 79 InterpolantComputations, 48 PerfectInterpolantSequences, 8535/9256 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...