./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt --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.1-dev-4e77c04 [2021-10-13 01:24:33,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:24:33,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:24:34,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:24:34,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:24:34,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:24:34,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:24:34,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:24:34,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:24:34,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:24:34,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:24:34,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:24:34,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:24:34,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:24:34,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:24:34,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:24:34,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:24:34,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:24:34,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:24:34,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:24:34,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:24:34,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:24:34,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:24:34,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:24:34,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:24:34,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:24:34,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:24:34,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:24:34,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:24:34,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:24:34,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:24:34,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:24:34,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:24:34,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:24:34,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:24:34,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:24:34,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:24:34,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:24:34,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:24:34,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:24:34,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:24:34,133 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:24:34,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:24:34,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:24:34,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:24:34,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:24:34,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:24:34,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:24:34,182 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:24:34,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:24:34,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:24:34,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:24:34,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:24:34,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:24:34,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:24:34,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:24:34,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:24:34,186 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:24:34,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:24:34,187 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:24:34,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:24:34,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:24:34,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:24:34,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:24:34,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:24:34,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:24:34,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:24:34,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:24:34,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:24:34,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:24:34,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:24:34,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:24:34,191 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_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/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_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt 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 [2021-10-13 01:24:34,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:24:34,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:24:34,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:24:34,520 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:24:34,520 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:24:34,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-13 01:24:34,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/data/5e27715d2/3476fbc590b6436c94d3762b789ca647/FLAG8b8756513 [2021-10-13 01:24:35,122 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:24:35,126 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-13 01:24:35,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/data/5e27715d2/3476fbc590b6436c94d3762b789ca647/FLAG8b8756513 [2021-10-13 01:24:35,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/data/5e27715d2/3476fbc590b6436c94d3762b789ca647 [2021-10-13 01:24:35,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:24:35,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:24:35,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:24:35,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:24:35,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:24:35,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e36f6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35, skipping insertion in model container [2021-10-13 01:24:35,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:24:35,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:24:35,756 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-10-13 01:24:35,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:24:35,769 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:24:35,826 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-10-13 01:24:35,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:24:35,842 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:24:35,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35 WrapperNode [2021-10-13 01:24:35,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:24:35,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:24:35,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:24:35,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:24:35,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:24:35,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:24:35,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:24:35,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:24:35,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:35,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:36,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:36,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:36,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:24:36,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:24:36,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:24:36,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:24:36,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (1/1) ... [2021-10-13 01:24:36,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:24:36,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:36,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:24:36,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:24:36,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:24:36,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:24:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:24:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:24:37,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:24:37,616 INFO L299 CfgBuilder]: Removed 173 assume(true) statements. [2021-10-13 01:24:37,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:37 BoogieIcfgContainer [2021-10-13 01:24:37,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:24:37,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:24:37,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:24:37,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:24:37,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:24:35" (1/3) ... [2021-10-13 01:24:37,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3f6cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:37, skipping insertion in model container [2021-10-13 01:24:37,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:35" (2/3) ... [2021-10-13 01:24:37,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3f6cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:37, skipping insertion in model container [2021-10-13 01:24:37,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:37" (3/3) ... [2021-10-13 01:24:37,628 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-10-13 01:24:37,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:24:37,635 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2021-10-13 01:24:37,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:24:37,699 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:24:37,699 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-10-13 01:24:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 480 states have (on average 1.8020833333333333) internal successors, (865), 517 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 01:24:37,736 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:37,736 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:37,737 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2021-10-13 01:24:37,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:37,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235977664] [2021-10-13 01:24:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:37,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:37,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:37,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235977664] [2021-10-13 01:24:37,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235977664] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:37,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:37,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:37,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394806377] [2021-10-13 01:24:37,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:37,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:37,967 INFO L87 Difference]: Start difference. First operand has 518 states, 480 states have (on average 1.8020833333333333) internal successors, (865), 517 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:38,252 INFO L93 Difference]: Finished difference Result 1244 states and 2057 transitions. [2021-10-13 01:24:38,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 01:24:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:38,273 INFO L225 Difference]: With dead ends: 1244 [2021-10-13 01:24:38,274 INFO L226 Difference]: Without dead ends: 720 [2021-10-13 01:24:38,280 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-10-13 01:24:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 454. [2021-10-13 01:24:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 423 states have (on average 1.6761229314420805) internal successors, (709), 453 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 709 transitions. [2021-10-13 01:24:38,368 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 709 transitions. Word has length 9 [2021-10-13 01:24:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:38,369 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 709 transitions. [2021-10-13 01:24:38,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 709 transitions. [2021-10-13 01:24:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:24:38,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:38,371 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:38,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:24:38,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2021-10-13 01:24:38,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:38,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865056093] [2021-10-13 01:24:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:38,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:38,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:38,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865056093] [2021-10-13 01:24:38,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865056093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:38,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:38,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:38,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48845033] [2021-10-13 01:24:38,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:38,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:38,469 INFO L87 Difference]: Start difference. First operand 454 states and 709 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:38,538 INFO L93 Difference]: Finished difference Result 1122 states and 1737 transitions. [2021-10-13 01:24:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 01:24:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:38,544 INFO L225 Difference]: With dead ends: 1122 [2021-10-13 01:24:38,544 INFO L226 Difference]: Without dead ends: 670 [2021-10-13 01:24:38,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-13 01:24:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 421. [2021-10-13 01:24:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 393 states have (on average 1.6564885496183206) internal successors, (651), 420 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2021-10-13 01:24:38,569 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 10 [2021-10-13 01:24:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:38,569 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2021-10-13 01:24:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2021-10-13 01:24:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 01:24:38,573 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:38,573 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:38,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:24:38,574 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash -248055967, now seen corresponding path program 1 times [2021-10-13 01:24:38,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:38,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321370259] [2021-10-13 01:24:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:38,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:38,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:38,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321370259] [2021-10-13 01:24:38,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321370259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:38,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:38,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:38,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009942789] [2021-10-13 01:24:38,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:38,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:38,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:38,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:38,673 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:38,736 INFO L93 Difference]: Finished difference Result 1241 states and 1924 transitions. [2021-10-13 01:24:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:38,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 01:24:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:38,751 INFO L225 Difference]: With dead ends: 1241 [2021-10-13 01:24:38,751 INFO L226 Difference]: Without dead ends: 830 [2021-10-13 01:24:38,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-10-13 01:24:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 425. [2021-10-13 01:24:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 397 states have (on average 1.649874055415617) internal successors, (655), 424 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 655 transitions. [2021-10-13 01:24:38,775 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 655 transitions. Word has length 14 [2021-10-13 01:24:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:38,775 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 655 transitions. [2021-10-13 01:24:38,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 655 transitions. [2021-10-13 01:24:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 01:24:38,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:38,781 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:38,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:24:38,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:38,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2021-10-13 01:24:38,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:38,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101827561] [2021-10-13 01:24:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:38,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:38,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:38,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101827561] [2021-10-13 01:24:38,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101827561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:38,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:38,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:38,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362417097] [2021-10-13 01:24:38,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:38,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:38,883 INFO L87 Difference]: Start difference. First operand 425 states and 655 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:38,978 INFO L93 Difference]: Finished difference Result 1564 states and 2392 transitions. [2021-10-13 01:24:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:38,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 01:24:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:38,986 INFO L225 Difference]: With dead ends: 1564 [2021-10-13 01:24:38,987 INFO L226 Difference]: Without dead ends: 1153 [2021-10-13 01:24:38,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2021-10-13 01:24:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 427. [2021-10-13 01:24:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 399 states have (on average 1.6466165413533835) internal successors, (657), 426 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 657 transitions. [2021-10-13 01:24:39,014 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 657 transitions. Word has length 18 [2021-10-13 01:24:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:39,015 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 657 transitions. [2021-10-13 01:24:39,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 657 transitions. [2021-10-13 01:24:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:24:39,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:39,018 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:39,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:24:39,019 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1707916525, now seen corresponding path program 1 times [2021-10-13 01:24:39,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:39,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441628261] [2021-10-13 01:24:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:39,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:39,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:39,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441628261] [2021-10-13 01:24:39,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441628261] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:39,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:39,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:39,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697028571] [2021-10-13 01:24:39,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:39,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:39,114 INFO L87 Difference]: Start difference. First operand 427 states and 657 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:39,160 INFO L93 Difference]: Finished difference Result 904 states and 1380 transitions. [2021-10-13 01:24:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 01:24:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:39,165 INFO L225 Difference]: With dead ends: 904 [2021-10-13 01:24:39,166 INFO L226 Difference]: Without dead ends: 662 [2021-10-13 01:24:39,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-10-13 01:24:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 425. [2021-10-13 01:24:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 397 states have (on average 1.63727959697733) internal successors, (650), 424 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 650 transitions. [2021-10-13 01:24:39,186 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 650 transitions. Word has length 19 [2021-10-13 01:24:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:39,187 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 650 transitions. [2021-10-13 01:24:39,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 650 transitions. [2021-10-13 01:24:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 01:24:39,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:39,190 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:39,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:24:39,190 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2021-10-13 01:24:39,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:39,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126101297] [2021-10-13 01:24:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:39,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:39,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:39,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126101297] [2021-10-13 01:24:39,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126101297] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:39,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044458423] [2021-10-13 01:24:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:39,269 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:39,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:39,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:39,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:24:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:39,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 01:24:39,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:39,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044458423] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:39,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:39,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-13 01:24:39,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651588031] [2021-10-13 01:24:39,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:24:39,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:24:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:39,544 INFO L87 Difference]: Start difference. First operand 425 states and 650 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:39,667 INFO L93 Difference]: Finished difference Result 1655 states and 2545 transitions. [2021-10-13 01:24:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:24:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 01:24:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:39,675 INFO L225 Difference]: With dead ends: 1655 [2021-10-13 01:24:39,675 INFO L226 Difference]: Without dead ends: 1241 [2021-10-13 01:24:39,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-10-13 01:24:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 571. [2021-10-13 01:24:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 543 states have (on average 1.6574585635359116) internal successors, (900), 570 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 900 transitions. [2021-10-13 01:24:39,715 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 900 transitions. Word has length 21 [2021-10-13 01:24:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:39,716 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 900 transitions. [2021-10-13 01:24:39,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 900 transitions. [2021-10-13 01:24:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:24:39,717 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:39,717 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:39,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:39,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-13 01:24:39,918 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1165168607, now seen corresponding path program 2 times [2021-10-13 01:24:39,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:39,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316036651] [2021-10-13 01:24:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:39,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:24:39,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:39,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316036651] [2021-10-13 01:24:39,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316036651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:39,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:39,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:39,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251660385] [2021-10-13 01:24:39,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:39,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:39,957 INFO L87 Difference]: Start difference. First operand 571 states and 900 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,051 INFO L93 Difference]: Finished difference Result 1288 states and 2001 transitions. [2021-10-13 01:24:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:24:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,056 INFO L225 Difference]: With dead ends: 1288 [2021-10-13 01:24:40,057 INFO L226 Difference]: Without dead ends: 775 [2021-10-13 01:24:40,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-13 01:24:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 505. [2021-10-13 01:24:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 482 states have (on average 1.607883817427386) internal successors, (775), 504 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 775 transitions. [2021-10-13 01:24:40,078 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 775 transitions. Word has length 28 [2021-10-13 01:24:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,078 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 775 transitions. [2021-10-13 01:24:40,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 775 transitions. [2021-10-13 01:24:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:24:40,079 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,080 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:40,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:24:40,080 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 777427029, now seen corresponding path program 1 times [2021-10-13 01:24:40,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951457681] [2021-10-13 01:24:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:24:40,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951457681] [2021-10-13 01:24:40,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951457681] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:40,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082053688] [2021-10-13 01:24:40,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:40,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,128 INFO L87 Difference]: Start difference. First operand 505 states and 775 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,191 INFO L93 Difference]: Finished difference Result 1156 states and 1760 transitions. [2021-10-13 01:24:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:24:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,196 INFO L225 Difference]: With dead ends: 1156 [2021-10-13 01:24:40,196 INFO L226 Difference]: Without dead ends: 682 [2021-10-13 01:24:40,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-10-13 01:24:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 454. [2021-10-13 01:24:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.5727482678983833) internal successors, (681), 453 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 681 transitions. [2021-10-13 01:24:40,217 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 681 transitions. Word has length 28 [2021-10-13 01:24:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,217 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 681 transitions. [2021-10-13 01:24:40,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 681 transitions. [2021-10-13 01:24:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 01:24:40,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,221 INFO L512 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] [2021-10-13 01:24:40,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:24:40,222 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 104948594, now seen corresponding path program 1 times [2021-10-13 01:24:40,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289785801] [2021-10-13 01:24:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-13 01:24:40,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289785801] [2021-10-13 01:24:40,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289785801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:40,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667272965] [2021-10-13 01:24:40,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:40,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:40,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:40,309 INFO L87 Difference]: Start difference. First operand 454 states and 681 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,362 INFO L93 Difference]: Finished difference Result 1090 states and 1641 transitions. [2021-10-13 01:24:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:24:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 01:24:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,369 INFO L225 Difference]: With dead ends: 1090 [2021-10-13 01:24:40,369 INFO L226 Difference]: Without dead ends: 680 [2021-10-13 01:24:40,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-10-13 01:24:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 454. [2021-10-13 01:24:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.5681293302540416) internal successors, (679), 453 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 679 transitions. [2021-10-13 01:24:40,395 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 679 transitions. Word has length 38 [2021-10-13 01:24:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,395 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 679 transitions. [2021-10-13 01:24:40,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 679 transitions. [2021-10-13 01:24:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 01:24:40,396 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,397 INFO L512 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] [2021-10-13 01:24:40,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:24:40,397 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1338937392, now seen corresponding path program 1 times [2021-10-13 01:24:40,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089926946] [2021-10-13 01:24:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:24:40,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089926946] [2021-10-13 01:24:40,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089926946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:40,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120865117] [2021-10-13 01:24:40,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:40,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:40,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,458 INFO L87 Difference]: Start difference. First operand 454 states and 679 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,501 INFO L93 Difference]: Finished difference Result 1026 states and 1540 transitions. [2021-10-13 01:24:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:40,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-13 01:24:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,506 INFO L225 Difference]: With dead ends: 1026 [2021-10-13 01:24:40,506 INFO L226 Difference]: Without dead ends: 635 [2021-10-13 01:24:40,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-10-13 01:24:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 410. [2021-10-13 01:24:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 390 states have (on average 1.5512820512820513) internal successors, (605), 409 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2021-10-13 01:24:40,523 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 50 [2021-10-13 01:24:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,523 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2021-10-13 01:24:40,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2021-10-13 01:24:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 01:24:40,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,524 INFO L512 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] [2021-10-13 01:24:40,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:24:40,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash 970476669, now seen corresponding path program 1 times [2021-10-13 01:24:40,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219926151] [2021-10-13 01:24:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:24:40,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219926151] [2021-10-13 01:24:40,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219926151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:40,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352664986] [2021-10-13 01:24:40,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:40,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,573 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,632 INFO L93 Difference]: Finished difference Result 860 states and 1269 transitions. [2021-10-13 01:24:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-13 01:24:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,636 INFO L225 Difference]: With dead ends: 860 [2021-10-13 01:24:40,637 INFO L226 Difference]: Without dead ends: 505 [2021-10-13 01:24:40,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-13 01:24:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 366. [2021-10-13 01:24:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 350 states have (on average 1.477142857142857) internal successors, (517), 365 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 517 transitions. [2021-10-13 01:24:40,655 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 517 transitions. Word has length 51 [2021-10-13 01:24:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,655 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 517 transitions. [2021-10-13 01:24:40,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 517 transitions. [2021-10-13 01:24:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 01:24:40,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,657 INFO L512 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] [2021-10-13 01:24:40,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:24:40,663 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash 216341264, now seen corresponding path program 1 times [2021-10-13 01:24:40,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195572763] [2021-10-13 01:24:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:24:40,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195572763] [2021-10-13 01:24:40,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195572763] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:40,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609231505] [2021-10-13 01:24:40,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:40,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:40,718 INFO L87 Difference]: Start difference. First operand 366 states and 517 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,768 INFO L93 Difference]: Finished difference Result 868 states and 1248 transitions. [2021-10-13 01:24:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:24:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-13 01:24:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,773 INFO L225 Difference]: With dead ends: 868 [2021-10-13 01:24:40,773 INFO L226 Difference]: Without dead ends: 574 [2021-10-13 01:24:40,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-13 01:24:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 366. [2021-10-13 01:24:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 350 states have (on average 1.4714285714285715) internal successors, (515), 365 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 515 transitions. [2021-10-13 01:24:40,788 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 515 transitions. Word has length 62 [2021-10-13 01:24:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,789 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 515 transitions. [2021-10-13 01:24:40,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2021-10-13 01:24:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-13 01:24:40,790 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,791 INFO L512 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] [2021-10-13 01:24:40,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:24:40,792 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash 542276843, now seen corresponding path program 1 times [2021-10-13 01:24:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143964409] [2021-10-13 01:24:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:24:40,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:40,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143964409] [2021-10-13 01:24:40,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143964409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:40,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:40,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:40,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051573224] [2021-10-13 01:24:40,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:40,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,883 INFO L87 Difference]: Start difference. First operand 366 states and 515 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:40,925 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2021-10-13 01:24:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:40,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-10-13 01:24:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:40,929 INFO L225 Difference]: With dead ends: 718 [2021-10-13 01:24:40,929 INFO L226 Difference]: Without dead ends: 458 [2021-10-13 01:24:40,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-13 01:24:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 324. [2021-10-13 01:24:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 318 states have (on average 1.449685534591195) internal successors, (461), 323 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 461 transitions. [2021-10-13 01:24:40,943 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 461 transitions. Word has length 76 [2021-10-13 01:24:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:40,943 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 461 transitions. [2021-10-13 01:24:40,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 461 transitions. [2021-10-13 01:24:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-13 01:24:40,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:40,945 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:40,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:24:40,945 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -532838176, now seen corresponding path program 1 times [2021-10-13 01:24:40,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:40,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766688096] [2021-10-13 01:24:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:40,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:24:41,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766688096] [2021-10-13 01:24:41,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766688096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:41,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947917686] [2021-10-13 01:24:41,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:41,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:41,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,010 INFO L87 Difference]: Start difference. First operand 324 states and 461 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,040 INFO L93 Difference]: Finished difference Result 510 states and 741 transitions. [2021-10-13 01:24:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-10-13 01:24:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,042 INFO L225 Difference]: With dead ends: 510 [2021-10-13 01:24:41,043 INFO L226 Difference]: Without dead ends: 270 [2021-10-13 01:24:41,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-13 01:24:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 01:24:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4318181818181819) internal successors, (378), 269 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2021-10-13 01:24:41,053 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 85 [2021-10-13 01:24:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,054 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2021-10-13 01:24:41,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2021-10-13 01:24:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-13 01:24:41,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,061 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:41,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:24:41,061 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1722161102, now seen corresponding path program 1 times [2021-10-13 01:24:41,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054103624] [2021-10-13 01:24:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-13 01:24:41,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054103624] [2021-10-13 01:24:41,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054103624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:41,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392988292] [2021-10-13 01:24:41,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:41,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:41,132 INFO L87 Difference]: Start difference. First operand 270 states and 378 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,166 INFO L93 Difference]: Finished difference Result 442 states and 636 transitions. [2021-10-13 01:24:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:24:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-13 01:24:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,169 INFO L225 Difference]: With dead ends: 442 [2021-10-13 01:24:41,169 INFO L226 Difference]: Without dead ends: 270 [2021-10-13 01:24:41,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-13 01:24:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 01:24:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.4242424242424243) internal successors, (376), 269 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 376 transitions. [2021-10-13 01:24:41,183 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 376 transitions. Word has length 88 [2021-10-13 01:24:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,183 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 376 transitions. [2021-10-13 01:24:41,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 376 transitions. [2021-10-13 01:24:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 01:24:41,185 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,185 INFO L512 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, 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] [2021-10-13 01:24:41,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:24:41,185 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash 621115599, now seen corresponding path program 1 times [2021-10-13 01:24:41,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075403796] [2021-10-13 01:24:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:24:41,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075403796] [2021-10-13 01:24:41,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075403796] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:41,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534168189] [2021-10-13 01:24:41,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:41,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,256 INFO L87 Difference]: Start difference. First operand 270 states and 376 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,282 INFO L93 Difference]: Finished difference Result 571 states and 833 transitions. [2021-10-13 01:24:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-13 01:24:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,285 INFO L225 Difference]: With dead ends: 571 [2021-10-13 01:24:41,285 INFO L226 Difference]: Without dead ends: 404 [2021-10-13 01:24:41,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-10-13 01:24:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 265. [2021-10-13 01:24:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.4153846153846155) internal successors, (368), 264 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 368 transitions. [2021-10-13 01:24:41,300 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 368 transitions. Word has length 101 [2021-10-13 01:24:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,300 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 368 transitions. [2021-10-13 01:24:41,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 368 transitions. [2021-10-13 01:24:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-13 01:24:41,301 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,302 INFO L512 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, 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] [2021-10-13 01:24:41,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:24:41,303 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2003384041, now seen corresponding path program 1 times [2021-10-13 01:24:41,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338087346] [2021-10-13 01:24:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:24:41,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338087346] [2021-10-13 01:24:41,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338087346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:41,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263617658] [2021-10-13 01:24:41,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:41,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,362 INFO L87 Difference]: Start difference. First operand 265 states and 368 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,388 INFO L93 Difference]: Finished difference Result 552 states and 804 transitions. [2021-10-13 01:24:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:41,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-10-13 01:24:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,392 INFO L225 Difference]: With dead ends: 552 [2021-10-13 01:24:41,392 INFO L226 Difference]: Without dead ends: 390 [2021-10-13 01:24:41,393 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-13 01:24:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2021-10-13 01:24:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.404669260700389) internal successors, (361), 260 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 361 transitions. [2021-10-13 01:24:41,405 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 361 transitions. Word has length 106 [2021-10-13 01:24:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,405 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 361 transitions. [2021-10-13 01:24:41,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 361 transitions. [2021-10-13 01:24:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-13 01:24:41,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,408 INFO L512 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, 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] [2021-10-13 01:24:41,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:24:41,408 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2064909061, now seen corresponding path program 1 times [2021-10-13 01:24:41,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135061316] [2021-10-13 01:24:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:24:41,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135061316] [2021-10-13 01:24:41,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135061316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:41,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975720396] [2021-10-13 01:24:41,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:41,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,472 INFO L87 Difference]: Start difference. First operand 261 states and 361 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,493 INFO L93 Difference]: Finished difference Result 417 states and 597 transitions. [2021-10-13 01:24:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-10-13 01:24:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,495 INFO L225 Difference]: With dead ends: 417 [2021-10-13 01:24:41,495 INFO L226 Difference]: Without dead ends: 259 [2021-10-13 01:24:41,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-13 01:24:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-10-13 01:24:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 255 states have (on average 1.392156862745098) internal successors, (355), 257 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2021-10-13 01:24:41,507 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 112 [2021-10-13 01:24:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,507 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2021-10-13 01:24:41,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2021-10-13 01:24:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-13 01:24:41,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,509 INFO L512 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, 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] [2021-10-13 01:24:41,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:24:41,509 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash 774981206, now seen corresponding path program 1 times [2021-10-13 01:24:41,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508376273] [2021-10-13 01:24:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-13 01:24:41,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508376273] [2021-10-13 01:24:41,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508376273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:41,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:41,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:41,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154181858] [2021-10-13 01:24:41,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:41,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,569 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:41,580 INFO L93 Difference]: Finished difference Result 459 states and 656 transitions. [2021-10-13 01:24:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-10-13 01:24:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:41,583 INFO L225 Difference]: With dead ends: 459 [2021-10-13 01:24:41,583 INFO L226 Difference]: Without dead ends: 304 [2021-10-13 01:24:41,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-10-13 01:24:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 255. [2021-10-13 01:24:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 253 states have (on average 1.3873517786561265) internal successors, (351), 254 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 351 transitions. [2021-10-13 01:24:41,595 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 351 transitions. Word has length 119 [2021-10-13 01:24:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:41,595 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 351 transitions. [2021-10-13 01:24:41,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 351 transitions. [2021-10-13 01:24:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-13 01:24:41,597 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:41,597 INFO L512 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, 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] [2021-10-13 01:24:41,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:24:41,598 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1814887070, now seen corresponding path program 1 times [2021-10-13 01:24:41,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:41,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378507333] [2021-10-13 01:24:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-13 01:24:41,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:41,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378507333] [2021-10-13 01:24:41,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378507333] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:41,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247898074] [2021-10-13 01:24:41,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:41,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:41,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:41,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:41,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 01:24:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:41,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 01:24:41,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-13 01:24:42,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247898074] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:42,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:42,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-13 01:24:42,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322286492] [2021-10-13 01:24:42,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:24:42,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:24:42,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:42,145 INFO L87 Difference]: Start difference. First operand 255 states and 351 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:42,210 INFO L93 Difference]: Finished difference Result 532 states and 731 transitions. [2021-10-13 01:24:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-10-13 01:24:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:42,212 INFO L225 Difference]: With dead ends: 532 [2021-10-13 01:24:42,212 INFO L226 Difference]: Without dead ends: 296 [2021-10-13 01:24:42,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-13 01:24:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-10-13 01:24:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 294 states have (on average 1.3605442176870748) internal successors, (400), 295 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 400 transitions. [2021-10-13 01:24:42,225 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 400 transitions. Word has length 122 [2021-10-13 01:24:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:42,226 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 400 transitions. [2021-10-13 01:24:42,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2021-10-13 01:24:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 01:24:42,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:42,228 INFO L512 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] [2021-10-13 01:24:42,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:42,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:42,449 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2087750763, now seen corresponding path program 2 times [2021-10-13 01:24:42,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:42,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923427806] [2021-10-13 01:24:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:42,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:42,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:42,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923427806] [2021-10-13 01:24:42,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923427806] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:42,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:42,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:42,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335529704] [2021-10-13 01:24:42,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:42,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:42,577 INFO L87 Difference]: Start difference. First operand 296 states and 400 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:42,669 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2021-10-13 01:24:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-10-13 01:24:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:42,673 INFO L225 Difference]: With dead ends: 624 [2021-10-13 01:24:42,673 INFO L226 Difference]: Without dead ends: 472 [2021-10-13 01:24:42,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-13 01:24:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 378. [2021-10-13 01:24:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 376 states have (on average 1.377659574468085) internal successors, (518), 377 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2021-10-13 01:24:42,693 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 159 [2021-10-13 01:24:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:42,694 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2021-10-13 01:24:42,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2021-10-13 01:24:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-13 01:24:42,696 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:42,697 INFO L512 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] [2021-10-13 01:24:42,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:24:42,697 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1509135504, now seen corresponding path program 1 times [2021-10-13 01:24:42,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:42,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766070803] [2021-10-13 01:24:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:42,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:42,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:42,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766070803] [2021-10-13 01:24:42,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766070803] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:42,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:42,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:42,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216763664] [2021-10-13 01:24:42,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:42,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:42,784 INFO L87 Difference]: Start difference. First operand 378 states and 518 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:42,828 INFO L93 Difference]: Finished difference Result 783 states and 1118 transitions. [2021-10-13 01:24:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-10-13 01:24:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:42,833 INFO L225 Difference]: With dead ends: 783 [2021-10-13 01:24:42,833 INFO L226 Difference]: Without dead ends: 587 [2021-10-13 01:24:42,834 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-10-13 01:24:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 448. [2021-10-13 01:24:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 446 states have (on average 1.383408071748879) internal successors, (617), 447 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 617 transitions. [2021-10-13 01:24:42,861 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 617 transitions. Word has length 176 [2021-10-13 01:24:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:42,861 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 617 transitions. [2021-10-13 01:24:42,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 617 transitions. [2021-10-13 01:24:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-13 01:24:42,864 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:42,864 INFO L512 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] [2021-10-13 01:24:42,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 01:24:42,864 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1608082732, now seen corresponding path program 1 times [2021-10-13 01:24:42,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:42,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209765912] [2021-10-13 01:24:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:42,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:42,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:42,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209765912] [2021-10-13 01:24:42,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209765912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:42,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:42,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:42,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403504576] [2021-10-13 01:24:42,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:42,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:42,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:42,967 INFO L87 Difference]: Start difference. First operand 448 states and 617 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:43,022 INFO L93 Difference]: Finished difference Result 932 states and 1331 transitions. [2021-10-13 01:24:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-10-13 01:24:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:43,027 INFO L225 Difference]: With dead ends: 932 [2021-10-13 01:24:43,027 INFO L226 Difference]: Without dead ends: 693 [2021-10-13 01:24:43,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-13 01:24:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 542. [2021-10-13 01:24:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 540 states have (on average 1.3907407407407408) internal successors, (751), 541 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 751 transitions. [2021-10-13 01:24:43,070 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 751 transitions. Word has length 177 [2021-10-13 01:24:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:43,071 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 751 transitions. [2021-10-13 01:24:43,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 751 transitions. [2021-10-13 01:24:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 01:24:43,074 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:43,074 INFO L512 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] [2021-10-13 01:24:43,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 01:24:43,075 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:43,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1599154325, now seen corresponding path program 1 times [2021-10-13 01:24:43,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:43,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091453828] [2021-10-13 01:24:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:43,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:43,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:43,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091453828] [2021-10-13 01:24:43,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091453828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:43,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:43,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:43,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92813010] [2021-10-13 01:24:43,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:43,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:43,185 INFO L87 Difference]: Start difference. First operand 542 states and 751 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:43,238 INFO L93 Difference]: Finished difference Result 1108 states and 1589 transitions. [2021-10-13 01:24:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:43,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-10-13 01:24:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:43,244 INFO L225 Difference]: With dead ends: 1108 [2021-10-13 01:24:43,244 INFO L226 Difference]: Without dead ends: 805 [2021-10-13 01:24:43,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-10-13 01:24:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 628. [2021-10-13 01:24:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.404153354632588) internal successors, (879), 627 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 879 transitions. [2021-10-13 01:24:43,285 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 879 transitions. Word has length 178 [2021-10-13 01:24:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:43,286 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 879 transitions. [2021-10-13 01:24:43,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 879 transitions. [2021-10-13 01:24:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-13 01:24:43,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:43,288 INFO L512 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] [2021-10-13 01:24:43,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 01:24:43,289 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2021856151, now seen corresponding path program 1 times [2021-10-13 01:24:43,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:43,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724808051] [2021-10-13 01:24:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:43,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:43,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:43,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724808051] [2021-10-13 01:24:43,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724808051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:43,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:43,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:24:43,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157388095] [2021-10-13 01:24:43,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:24:43,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:24:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:43,373 INFO L87 Difference]: Start difference. First operand 628 states and 879 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:43,525 INFO L93 Difference]: Finished difference Result 1256 states and 1747 transitions. [2021-10-13 01:24:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:24:43,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-10-13 01:24:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:43,531 INFO L225 Difference]: With dead ends: 1256 [2021-10-13 01:24:43,531 INFO L226 Difference]: Without dead ends: 875 [2021-10-13 01:24:43,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:24:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-10-13 01:24:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 628. [2021-10-13 01:24:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.389776357827476) internal successors, (870), 627 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2021-10-13 01:24:43,577 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2021-10-13 01:24:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:43,578 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2021-10-13 01:24:43,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2021-10-13 01:24:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-13 01:24:43,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:43,581 INFO L512 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] [2021-10-13 01:24:43,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 01:24:43,583 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1934782051, now seen corresponding path program 1 times [2021-10-13 01:24:43,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:43,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660600956] [2021-10-13 01:24:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:43,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:43,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:43,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660600956] [2021-10-13 01:24:43,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660600956] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:43,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:43,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:24:43,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634927067] [2021-10-13 01:24:43,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:24:43,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:24:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:43,706 INFO L87 Difference]: Start difference. First operand 628 states and 870 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:43,860 INFO L93 Difference]: Finished difference Result 1481 states and 2092 transitions. [2021-10-13 01:24:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:24:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-10-13 01:24:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:43,867 INFO L225 Difference]: With dead ends: 1481 [2021-10-13 01:24:43,867 INFO L226 Difference]: Without dead ends: 1100 [2021-10-13 01:24:43,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:24:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-10-13 01:24:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 628. [2021-10-13 01:24:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 626 states have (on average 1.3881789137380192) internal successors, (869), 627 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2021-10-13 01:24:43,912 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 179 [2021-10-13 01:24:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:43,913 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2021-10-13 01:24:43,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2021-10-13 01:24:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 01:24:43,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:43,915 INFO L512 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] [2021-10-13 01:24:43,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 01:24:43,916 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 356758881, now seen corresponding path program 1 times [2021-10-13 01:24:43,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:43,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542489838] [2021-10-13 01:24:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:43,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:44,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:44,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542489838] [2021-10-13 01:24:44,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542489838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:44,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:44,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:44,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978997116] [2021-10-13 01:24:44,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:44,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:44,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:44,018 INFO L87 Difference]: Start difference. First operand 628 states and 869 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:44,058 INFO L93 Difference]: Finished difference Result 1011 states and 1430 transitions. [2021-10-13 01:24:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-13 01:24:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:44,071 INFO L225 Difference]: With dead ends: 1011 [2021-10-13 01:24:44,071 INFO L226 Difference]: Without dead ends: 610 [2021-10-13 01:24:44,072 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-13 01:24:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2021-10-13 01:24:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 1.3733552631578947) internal successors, (835), 609 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 835 transitions. [2021-10-13 01:24:44,122 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 835 transitions. Word has length 180 [2021-10-13 01:24:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:44,123 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 835 transitions. [2021-10-13 01:24:44,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 835 transitions. [2021-10-13 01:24:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-10-13 01:24:44,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:44,126 INFO L512 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] [2021-10-13 01:24:44,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 01:24:44,126 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -970239779, now seen corresponding path program 1 times [2021-10-13 01:24:44,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:44,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106015902] [2021-10-13 01:24:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:44,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:44,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:44,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106015902] [2021-10-13 01:24:44,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106015902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:44,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:44,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:24:44,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397278463] [2021-10-13 01:24:44,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:24:44,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:24:44,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:44,263 INFO L87 Difference]: Start difference. First operand 610 states and 835 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:44,428 INFO L93 Difference]: Finished difference Result 1000 states and 1388 transitions. [2021-10-13 01:24:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:24:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-10-13 01:24:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:44,434 INFO L225 Difference]: With dead ends: 1000 [2021-10-13 01:24:44,434 INFO L226 Difference]: Without dead ends: 998 [2021-10-13 01:24:44,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:24:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-10-13 01:24:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 612. [2021-10-13 01:24:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 610 states have (on average 1.3721311475409836) internal successors, (837), 611 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 837 transitions. [2021-10-13 01:24:44,482 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 837 transitions. Word has length 180 [2021-10-13 01:24:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:44,482 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 837 transitions. [2021-10-13 01:24:44,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 837 transitions. [2021-10-13 01:24:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-13 01:24:44,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:44,485 INFO L512 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] [2021-10-13 01:24:44,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 01:24:44,486 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1672767509, now seen corresponding path program 1 times [2021-10-13 01:24:44,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:44,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514910805] [2021-10-13 01:24:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:44,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-13 01:24:44,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:44,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514910805] [2021-10-13 01:24:44,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514910805] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:44,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647251981] [2021-10-13 01:24:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:44,639 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:44,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:44,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 01:24:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:44,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 01:24:44,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-10-13 01:24:45,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647251981] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:45,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:45,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-10-13 01:24:45,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372075956] [2021-10-13 01:24:45,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:24:45,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:24:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:24:45,449 INFO L87 Difference]: Start difference. First operand 612 states and 837 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:46,153 INFO L93 Difference]: Finished difference Result 3671 states and 5205 transitions. [2021-10-13 01:24:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 01:24:46,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-10-13 01:24:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:46,172 INFO L225 Difference]: With dead ends: 3671 [2021-10-13 01:24:46,172 INFO L226 Difference]: Without dead ends: 3302 [2021-10-13 01:24:46,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-10-13 01:24:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2021-10-13 01:24:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 820. [2021-10-13 01:24:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 818 states have (on average 1.3508557457212713) internal successors, (1105), 819 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1105 transitions. [2021-10-13 01:24:46,255 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1105 transitions. Word has length 183 [2021-10-13 01:24:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:46,256 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1105 transitions. [2021-10-13 01:24:46,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1105 transitions. [2021-10-13 01:24:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-13 01:24:46,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:46,259 INFO L512 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] [2021-10-13 01:24:46,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:46,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-10-13 01:24:46,486 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1342336109, now seen corresponding path program 1 times [2021-10-13 01:24:46,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:46,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625078178] [2021-10-13 01:24:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:46,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:46,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:46,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625078178] [2021-10-13 01:24:46,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625078178] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:46,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:46,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:46,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072657654] [2021-10-13 01:24:46,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:46,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:46,586 INFO L87 Difference]: Start difference. First operand 820 states and 1105 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:46,743 INFO L93 Difference]: Finished difference Result 1825 states and 2496 transitions. [2021-10-13 01:24:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-10-13 01:24:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:46,752 INFO L225 Difference]: With dead ends: 1825 [2021-10-13 01:24:46,752 INFO L226 Difference]: Without dead ends: 1456 [2021-10-13 01:24:46,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-10-13 01:24:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 820. [2021-10-13 01:24:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 818 states have (on average 1.3484107579462103) internal successors, (1103), 819 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1103 transitions. [2021-10-13 01:24:46,817 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1103 transitions. Word has length 183 [2021-10-13 01:24:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:46,818 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1103 transitions. [2021-10-13 01:24:46,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1103 transitions. [2021-10-13 01:24:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-13 01:24:46,821 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:46,821 INFO L512 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] [2021-10-13 01:24:46,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 01:24:46,822 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -759019257, now seen corresponding path program 1 times [2021-10-13 01:24:46,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:46,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670121141] [2021-10-13 01:24:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:46,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-10-13 01:24:46,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:46,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670121141] [2021-10-13 01:24:46,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670121141] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:46,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:46,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:46,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976614518] [2021-10-13 01:24:46,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:46,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:46,874 INFO L87 Difference]: Start difference. First operand 820 states and 1103 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:46,945 INFO L93 Difference]: Finished difference Result 1372 states and 1859 transitions. [2021-10-13 01:24:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2021-10-13 01:24:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:46,950 INFO L225 Difference]: With dead ends: 1372 [2021-10-13 01:24:46,950 INFO L226 Difference]: Without dead ends: 673 [2021-10-13 01:24:46,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-13 01:24:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2021-10-13 01:24:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 670 states have (on average 1.3164179104477611) internal successors, (882), 671 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 882 transitions. [2021-10-13 01:24:47,003 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 882 transitions. Word has length 186 [2021-10-13 01:24:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:47,003 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 882 transitions. [2021-10-13 01:24:47,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 882 transitions. [2021-10-13 01:24:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-13 01:24:47,006 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:47,007 INFO L512 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] [2021-10-13 01:24:47,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 01:24:47,007 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1115601649, now seen corresponding path program 1 times [2021-10-13 01:24:47,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:47,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991844455] [2021-10-13 01:24:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:47,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:47,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991844455] [2021-10-13 01:24:47,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991844455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:47,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:47,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:24:47,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191055488] [2021-10-13 01:24:47,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:24:47,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:24:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:24:47,188 INFO L87 Difference]: Start difference. First operand 672 states and 882 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:47,475 INFO L93 Difference]: Finished difference Result 1442 states and 1925 transitions. [2021-10-13 01:24:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:24:47,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2021-10-13 01:24:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:47,482 INFO L225 Difference]: With dead ends: 1442 [2021-10-13 01:24:47,482 INFO L226 Difference]: Without dead ends: 1084 [2021-10-13 01:24:47,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:24:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-10-13 01:24:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 780. [2021-10-13 01:24:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 778 states have (on average 1.30719794344473) internal successors, (1017), 779 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1017 transitions. [2021-10-13 01:24:47,552 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1017 transitions. Word has length 191 [2021-10-13 01:24:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:47,552 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1017 transitions. [2021-10-13 01:24:47,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1017 transitions. [2021-10-13 01:24:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-13 01:24:47,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:47,556 INFO L512 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] [2021-10-13 01:24:47,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 01:24:47,556 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1484290453, now seen corresponding path program 1 times [2021-10-13 01:24:47,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:47,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56182714] [2021-10-13 01:24:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:47,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:47,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56182714] [2021-10-13 01:24:47,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56182714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:47,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:47,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:24:47,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152433282] [2021-10-13 01:24:47,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:24:47,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:24:47,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:47,662 INFO L87 Difference]: Start difference. First operand 780 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:47,892 INFO L93 Difference]: Finished difference Result 2558 states and 3458 transitions. [2021-10-13 01:24:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:24:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2021-10-13 01:24:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:47,908 INFO L225 Difference]: With dead ends: 2558 [2021-10-13 01:24:47,908 INFO L226 Difference]: Without dead ends: 2086 [2021-10-13 01:24:47,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2021-10-13 01:24:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 857. [2021-10-13 01:24:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.304093567251462) internal successors, (1115), 856 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1115 transitions. [2021-10-13 01:24:47,993 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1115 transitions. Word has length 197 [2021-10-13 01:24:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:47,993 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1115 transitions. [2021-10-13 01:24:47,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1115 transitions. [2021-10-13 01:24:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-13 01:24:47,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:47,997 INFO L512 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] [2021-10-13 01:24:47,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 01:24:47,997 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -725967573, now seen corresponding path program 1 times [2021-10-13 01:24:47,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:47,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913350933] [2021-10-13 01:24:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:48,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:48,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913350933] [2021-10-13 01:24:48,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913350933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:48,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:48,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:24:48,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869408052] [2021-10-13 01:24:48,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:24:48,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:24:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:24:48,130 INFO L87 Difference]: Start difference. First operand 857 states and 1115 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:48,611 INFO L93 Difference]: Finished difference Result 2074 states and 2728 transitions. [2021-10-13 01:24:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:24:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2021-10-13 01:24:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:48,618 INFO L225 Difference]: With dead ends: 2074 [2021-10-13 01:24:48,618 INFO L226 Difference]: Without dead ends: 1528 [2021-10-13 01:24:48,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 111.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:24:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2021-10-13 01:24:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 912. [2021-10-13 01:24:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 910 states have (on average 1.2912087912087913) internal successors, (1175), 911 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1175 transitions. [2021-10-13 01:24:48,707 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1175 transitions. Word has length 197 [2021-10-13 01:24:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:48,708 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1175 transitions. [2021-10-13 01:24:48,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1175 transitions. [2021-10-13 01:24:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-13 01:24:48,710 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:48,710 INFO L512 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] [2021-10-13 01:24:48,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 01:24:48,711 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1846866791, now seen corresponding path program 1 times [2021-10-13 01:24:48,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:48,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719877969] [2021-10-13 01:24:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:48,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:48,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:48,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719877969] [2021-10-13 01:24:48,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719877969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:48,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:48,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:24:48,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348426107] [2021-10-13 01:24:48,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:24:48,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:24:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:24:48,844 INFO L87 Difference]: Start difference. First operand 912 states and 1175 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:49,281 INFO L93 Difference]: Finished difference Result 1900 states and 2488 transitions. [2021-10-13 01:24:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:24:49,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2021-10-13 01:24:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:49,286 INFO L225 Difference]: With dead ends: 1900 [2021-10-13 01:24:49,286 INFO L226 Difference]: Without dead ends: 1294 [2021-10-13 01:24:49,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.6ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:24:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-13 01:24:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 879. [2021-10-13 01:24:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.2930444697833523) internal successors, (1134), 878 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1134 transitions. [2021-10-13 01:24:49,386 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1134 transitions. Word has length 197 [2021-10-13 01:24:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:49,386 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 1134 transitions. [2021-10-13 01:24:49,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1134 transitions. [2021-10-13 01:24:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-13 01:24:49,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:49,389 INFO L512 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] [2021-10-13 01:24:49,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 01:24:49,390 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2030555812, now seen corresponding path program 1 times [2021-10-13 01:24:49,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:49,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483380940] [2021-10-13 01:24:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:49,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-10-13 01:24:49,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:49,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483380940] [2021-10-13 01:24:49,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483380940] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:49,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:49,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:24:49,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062686155] [2021-10-13 01:24:49,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:24:49,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:24:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:24:49,467 INFO L87 Difference]: Start difference. First operand 879 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:49,657 INFO L93 Difference]: Finished difference Result 1596 states and 2088 transitions. [2021-10-13 01:24:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2021-10-13 01:24:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:49,661 INFO L225 Difference]: With dead ends: 1596 [2021-10-13 01:24:49,661 INFO L226 Difference]: Without dead ends: 1017 [2021-10-13 01:24:49,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-10-13 01:24:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 778. [2021-10-13 01:24:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.2754182754182755) internal successors, (991), 777 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 991 transitions. [2021-10-13 01:24:49,739 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 991 transitions. Word has length 207 [2021-10-13 01:24:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:49,739 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 991 transitions. [2021-10-13 01:24:49,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 991 transitions. [2021-10-13 01:24:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-13 01:24:49,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:49,742 INFO L512 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] [2021-10-13 01:24:49,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 01:24:49,743 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1428912634, now seen corresponding path program 1 times [2021-10-13 01:24:49,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:49,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749652234] [2021-10-13 01:24:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:49,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:50,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:50,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749652234] [2021-10-13 01:24:50,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749652234] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:50,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401764429] [2021-10-13 01:24:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:50,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:50,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:50,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:50,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 01:24:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 01:24:50,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-10-13 01:24:51,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401764429] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:51,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:24:51,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 26 [2021-10-13 01:24:51,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899083975] [2021-10-13 01:24:51,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:24:51,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:24:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2021-10-13 01:24:51,083 INFO L87 Difference]: Start difference. First operand 778 states and 991 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:51,556 INFO L93 Difference]: Finished difference Result 2195 states and 2822 transitions. [2021-10-13 01:24:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:24:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2021-10-13 01:24:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:51,560 INFO L225 Difference]: With dead ends: 2195 [2021-10-13 01:24:51,561 INFO L226 Difference]: Without dead ends: 1731 [2021-10-13 01:24:51,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 363.4ms TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:24:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2021-10-13 01:24:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 814. [2021-10-13 01:24:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.2742927429274293) internal successors, (1036), 813 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1036 transitions. [2021-10-13 01:24:51,659 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1036 transitions. Word has length 231 [2021-10-13 01:24:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:51,660 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1036 transitions. [2021-10-13 01:24:51,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1036 transitions. [2021-10-13 01:24:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-13 01:24:51,662 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:51,663 INFO L512 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] [2021-10-13 01:24:51,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:51,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-13 01:24:51,878 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1486170936, now seen corresponding path program 1 times [2021-10-13 01:24:51,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:51,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868970254] [2021-10-13 01:24:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:51,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-10-13 01:24:51,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:51,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868970254] [2021-10-13 01:24:51,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868970254] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:51,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:51,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:24:51,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67941400] [2021-10-13 01:24:51,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:24:51,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:24:51,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:51,979 INFO L87 Difference]: Start difference. First operand 814 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:52,107 INFO L93 Difference]: Finished difference Result 1579 states and 2001 transitions. [2021-10-13 01:24:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:24:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2021-10-13 01:24:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:52,110 INFO L225 Difference]: With dead ends: 1579 [2021-10-13 01:24:52,110 INFO L226 Difference]: Without dead ends: 1042 [2021-10-13 01:24:52,112 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:24:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2021-10-13 01:24:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 808. [2021-10-13 01:24:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.2478314745972738) internal successors, (1007), 807 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1007 transitions. [2021-10-13 01:24:52,202 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1007 transitions. Word has length 231 [2021-10-13 01:24:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:52,202 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1007 transitions. [2021-10-13 01:24:52,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:24:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1007 transitions. [2021-10-13 01:24:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-13 01:24:52,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:52,206 INFO L512 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, 1, 1, 1, 1, 1] [2021-10-13 01:24:52,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 01:24:52,206 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:24:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1782231364, now seen corresponding path program 1 times [2021-10-13 01:24:52,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:52,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341840220] [2021-10-13 01:24:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:52,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:24:52,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:52,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341840220] [2021-10-13 01:24:52,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341840220] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:52,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465037656] [2021-10-13 01:24:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:52,621 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:52,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:52,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 01:24:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-13 01:24:53,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-10-13 01:24:53,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465037656] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:53,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:53,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2021-10-13 01:24:53,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997743251] [2021-10-13 01:24:53,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-13 01:24:53,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-13 01:24:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-10-13 01:24:53,826 INFO L87 Difference]: Start difference. First operand 808 states and 1007 transitions. Second operand has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:00,343 INFO L93 Difference]: Finished difference Result 5517 states and 7042 transitions. [2021-10-13 01:25:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-10-13 01:25:00,343 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2021-10-13 01:25:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:00,354 INFO L225 Difference]: With dead ends: 5517 [2021-10-13 01:25:00,355 INFO L226 Difference]: Without dead ends: 5017 [2021-10-13 01:25:00,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8443 ImplicationChecksByTransitivity, 3388.9ms TimeCoverageRelationStatistics Valid=2584, Invalid=23498, Unknown=0, NotChecked=0, Total=26082 [2021-10-13 01:25:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2021-10-13 01:25:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 1662. [2021-10-13 01:25:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.2450331125827814) internal successors, (2068), 1661 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2068 transitions. [2021-10-13 01:25:00,605 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2068 transitions. Word has length 237 [2021-10-13 01:25:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:00,605 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 2068 transitions. [2021-10-13 01:25:00,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2068 transitions. [2021-10-13 01:25:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-10-13 01:25:00,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:00,610 INFO L512 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, 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] [2021-10-13 01:25:00,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 01:25:00,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-10-13 01:25:00,838 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 155215879, now seen corresponding path program 1 times [2021-10-13 01:25:00,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:00,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616043143] [2021-10-13 01:25:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:00,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-10-13 01:25:00,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:00,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616043143] [2021-10-13 01:25:00,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616043143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:25:00,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:25:00,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:25:00,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706151257] [2021-10-13 01:25:00,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:25:00,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:25:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:25:00,890 INFO L87 Difference]: Start difference. First operand 1662 states and 2068 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:01,050 INFO L93 Difference]: Finished difference Result 2954 states and 3675 transitions. [2021-10-13 01:25:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:25:01,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2021-10-13 01:25:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:01,053 INFO L225 Difference]: With dead ends: 2954 [2021-10-13 01:25:01,054 INFO L226 Difference]: Without dead ends: 1305 [2021-10-13 01:25:01,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:25:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2021-10-13 01:25:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2021-10-13 01:25:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.236963190184049) internal successors, (1613), 1304 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1613 transitions. [2021-10-13 01:25:01,212 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1613 transitions. Word has length 240 [2021-10-13 01:25:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:01,213 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1613 transitions. [2021-10-13 01:25:01,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1613 transitions. [2021-10-13 01:25:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-13 01:25:01,217 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:01,218 INFO L512 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] [2021-10-13 01:25:01,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 01:25:01,218 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 930274956, now seen corresponding path program 1 times [2021-10-13 01:25:01,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:01,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76500158] [2021-10-13 01:25:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:01,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-10-13 01:25:01,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:01,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76500158] [2021-10-13 01:25:01,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76500158] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:25:01,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:25:01,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:25:01,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516117595] [2021-10-13 01:25:01,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:25:01,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:25:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:25:01,330 INFO L87 Difference]: Start difference. First operand 1305 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:01,532 INFO L93 Difference]: Finished difference Result 2224 states and 2765 transitions. [2021-10-13 01:25:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:25:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2021-10-13 01:25:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:01,535 INFO L225 Difference]: With dead ends: 2224 [2021-10-13 01:25:01,536 INFO L226 Difference]: Without dead ends: 1314 [2021-10-13 01:25:01,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:25:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-13 01:25:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1311. [2021-10-13 01:25:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.2351145038167939) internal successors, (1618), 1310 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1618 transitions. [2021-10-13 01:25:01,755 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1618 transitions. Word has length 243 [2021-10-13 01:25:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:01,755 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1618 transitions. [2021-10-13 01:25:01,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1618 transitions. [2021-10-13 01:25:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-10-13 01:25:01,759 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:01,760 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:25:01,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 01:25:01,760 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 312923408, now seen corresponding path program 1 times [2021-10-13 01:25:01,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:01,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368808099] [2021-10-13 01:25:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:01,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:02,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:02,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368808099] [2021-10-13 01:25:02,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368808099] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:02,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565498805] [2021-10-13 01:25:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:02,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:02,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:25:02,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:25:02,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 01:25:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:02,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-13 01:25:02,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:25:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-10-13 01:25:04,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565498805] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:04,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:25:04,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-10-13 01:25:04,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825386202] [2021-10-13 01:25:04,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 01:25:04,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:04,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 01:25:04,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-10-13 01:25:04,116 INFO L87 Difference]: Start difference. First operand 1311 states and 1618 transitions. Second operand has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:19,868 INFO L93 Difference]: Finished difference Result 9864 states and 12523 transitions. [2021-10-13 01:25:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-10-13 01:25:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2021-10-13 01:25:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:19,887 INFO L225 Difference]: With dead ends: 9864 [2021-10-13 01:25:19,888 INFO L226 Difference]: Without dead ends: 8959 [2021-10-13 01:25:19,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19922 ImplicationChecksByTransitivity, 8719.3ms TimeCoverageRelationStatistics Valid=5900, Invalid=46312, Unknown=0, NotChecked=0, Total=52212 [2021-10-13 01:25:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8959 states. [2021-10-13 01:25:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8959 to 1881. [2021-10-13 01:25:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.247340425531915) internal successors, (2345), 1880 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2345 transitions. [2021-10-13 01:25:20,252 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2345 transitions. Word has length 244 [2021-10-13 01:25:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:20,252 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2345 transitions. [2021-10-13 01:25:20,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2345 transitions. [2021-10-13 01:25:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-13 01:25:20,258 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:20,259 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:25:20,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 01:25:20,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-10-13 01:25:20,482 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1707308140, now seen corresponding path program 1 times [2021-10-13 01:25:20,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:20,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722476474] [2021-10-13 01:25:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:20,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2021-10-13 01:25:20,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:20,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722476474] [2021-10-13 01:25:20,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722476474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:25:20,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:25:20,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:25:20,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345024046] [2021-10-13 01:25:20,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:25:20,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:25:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:25:20,628 INFO L87 Difference]: Start difference. First operand 1881 states and 2345 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:20,941 INFO L93 Difference]: Finished difference Result 3333 states and 4192 transitions. [2021-10-13 01:25:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:25:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2021-10-13 01:25:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:20,946 INFO L225 Difference]: With dead ends: 3333 [2021-10-13 01:25:20,946 INFO L226 Difference]: Without dead ends: 1881 [2021-10-13 01:25:20,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:25:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-10-13 01:25:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1881. [2021-10-13 01:25:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.2425531914893617) internal successors, (2336), 1880 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2336 transitions. [2021-10-13 01:25:21,226 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2336 transitions. Word has length 251 [2021-10-13 01:25:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:21,229 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2336 transitions. [2021-10-13 01:25:21,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2336 transitions. [2021-10-13 01:25:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-13 01:25:21,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:21,235 INFO L512 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, 1, 1, 1, 1, 1, 1] [2021-10-13 01:25:21,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 01:25:21,235 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1469760484, now seen corresponding path program 1 times [2021-10-13 01:25:21,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:21,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380429355] [2021-10-13 01:25:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:21,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:21,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:21,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380429355] [2021-10-13 01:25:21,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380429355] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:21,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925333590] [2021-10-13 01:25:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:21,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:25:21,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:25:21,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 01:25:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:22,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-13 01:25:22,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:25:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-13 01:25:23,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925333590] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:23,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:25:23,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2021-10-13 01:25:23,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807560732] [2021-10-13 01:25:23,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-13 01:25:23,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-13 01:25:23,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 01:25:23,619 INFO L87 Difference]: Start difference. First operand 1881 states and 2336 transitions. Second operand has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:32,901 INFO L93 Difference]: Finished difference Result 11574 states and 14748 transitions. [2021-10-13 01:25:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-10-13 01:25:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2021-10-13 01:25:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:32,922 INFO L225 Difference]: With dead ends: 11574 [2021-10-13 01:25:32,922 INFO L226 Difference]: Without dead ends: 10261 [2021-10-13 01:25:32,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10074 ImplicationChecksByTransitivity, 4196.1ms TimeCoverageRelationStatistics Valid=2832, Invalid=28320, Unknown=0, NotChecked=0, Total=31152 [2021-10-13 01:25:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2021-10-13 01:25:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 1881. [2021-10-13 01:25:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1880 states have (on average 1.2404255319148936) internal successors, (2332), 1880 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2332 transitions. [2021-10-13 01:25:33,233 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2332 transitions. Word has length 251 [2021-10-13 01:25:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:33,234 INFO L470 AbstractCegarLoop]: Abstraction has 1881 states and 2332 transitions. [2021-10-13 01:25:33,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.944444444444445) internal successors, (358), 36 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2332 transitions. [2021-10-13 01:25:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:25:33,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:33,239 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:25:33,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 01:25:33,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-10-13 01:25:33,466 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash 332354457, now seen corresponding path program 1 times [2021-10-13 01:25:33,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:33,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877350313] [2021-10-13 01:25:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:33,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:33,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:33,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877350313] [2021-10-13 01:25:33,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877350313] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:33,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719814575] [2021-10-13 01:25:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:33,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:25:33,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:25:33,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 01:25:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:34,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:25:34,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:25:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:35,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719814575] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:35,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:25:35,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-13 01:25:35,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527640867] [2021-10-13 01:25:35,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:25:35,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:25:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:25:35,077 INFO L87 Difference]: Start difference. First operand 1881 states and 2332 transitions. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:36,404 INFO L93 Difference]: Finished difference Result 7328 states and 9256 transitions. [2021-10-13 01:25:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-13 01:25:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:25:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:36,417 INFO L225 Difference]: With dead ends: 7328 [2021-10-13 01:25:36,417 INFO L226 Difference]: Without dead ends: 6238 [2021-10-13 01:25:36,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 372.6ms TimeCoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 01:25:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6238 states. [2021-10-13 01:25:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6238 to 3369. [2021-10-13 01:25:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.2419833729216152) internal successors, (4183), 3368 states have internal predecessors, (4183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4183 transitions. [2021-10-13 01:25:36,880 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4183 transitions. Word has length 268 [2021-10-13 01:25:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:36,881 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4183 transitions. [2021-10-13 01:25:36,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4183 transitions. [2021-10-13 01:25:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:25:36,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:36,890 INFO L512 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] [2021-10-13 01:25:36,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 01:25:37,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:37,106 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash 156390021, now seen corresponding path program 1 times [2021-10-13 01:25:37,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:37,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478722377] [2021-10-13 01:25:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:37,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:37,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:37,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478722377] [2021-10-13 01:25:37,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478722377] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:37,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787465361] [2021-10-13 01:25:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:37,371 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:25:37,373 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:25:37,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 01:25:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:38,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:25:38,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:25:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:38,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787465361] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:38,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:25:38,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-10-13 01:25:38,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579130472] [2021-10-13 01:25:38,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:25:38,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:25:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:25:38,919 INFO L87 Difference]: Start difference. First operand 3369 states and 4183 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:25:41,038 INFO L93 Difference]: Finished difference Result 14731 states and 18528 transitions. [2021-10-13 01:25:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-13 01:25:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:25:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:25:41,062 INFO L225 Difference]: With dead ends: 14731 [2021-10-13 01:25:41,062 INFO L226 Difference]: Without dead ends: 12520 [2021-10-13 01:25:41,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 333.8ms TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 01:25:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12520 states. [2021-10-13 01:25:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12520 to 4983. [2021-10-13 01:25:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4982 states have (on average 1.2193898032918506) internal successors, (6075), 4982 states have internal predecessors, (6075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6075 transitions. [2021-10-13 01:25:41,789 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6075 transitions. Word has length 268 [2021-10-13 01:25:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:25:41,790 INFO L470 AbstractCegarLoop]: Abstraction has 4983 states and 6075 transitions. [2021-10-13 01:25:41,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:25:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6075 transitions. [2021-10-13 01:25:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:25:41,801 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:25:41,802 INFO L512 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] [2021-10-13 01:25:41,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 01:25:42,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-10-13 01:25:42,030 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:25:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:25:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1506202107, now seen corresponding path program 1 times [2021-10-13 01:25:42,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:25:42,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451064856] [2021-10-13 01:25:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:42,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:25:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:42,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:25:42,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451064856] [2021-10-13 01:25:42,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451064856] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:42,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496642351] [2021-10-13 01:25:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:25:42,444 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:25:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:25:42,445 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:25:42,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 01:25:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:25:43,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-10-13 01:25:43,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:25:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:25:44,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496642351] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:25:44,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:25:44,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-13 01:25:44,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042789616] [2021-10-13 01:25:44,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 01:25:44,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:25:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 01:25:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:25:44,460 INFO L87 Difference]: Start difference. First operand 4983 states and 6075 transitions. Second operand has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:26:14,385 INFO L93 Difference]: Finished difference Result 53838 states and 68015 transitions. [2021-10-13 01:26:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-13 01:26:14,392 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:26:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:26:14,482 INFO L225 Difference]: With dead ends: 53838 [2021-10-13 01:26:14,482 INFO L226 Difference]: Without dead ends: 50191 [2021-10-13 01:26:14,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94096 ImplicationChecksByTransitivity, 16710.6ms TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-13 01:26:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50191 states. [2021-10-13 01:26:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50191 to 7440. [2021-10-13 01:26:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.2486893399650492) internal successors, (9289), 7439 states have internal predecessors, (9289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 9289 transitions. [2021-10-13 01:26:16,025 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 9289 transitions. Word has length 268 [2021-10-13 01:26:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:26:16,026 INFO L470 AbstractCegarLoop]: Abstraction has 7440 states and 9289 transitions. [2021-10-13 01:26:16,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.6875) internal successors, (374), 31 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 9289 transitions. [2021-10-13 01:26:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:26:16,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:26:16,042 INFO L512 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] [2021-10-13 01:26:16,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 01:26:16,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:26:16,258 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:26:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:26:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash -559164221, now seen corresponding path program 1 times [2021-10-13 01:26:16,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:26:16,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596908794] [2021-10-13 01:26:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:26:16,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:26:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:26:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-13 01:26:16,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:26:16,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596908794] [2021-10-13 01:26:16,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596908794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:26:16,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:26:16,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:26:16,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36063430] [2021-10-13 01:26:16,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:26:16,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:26:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:26:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:26:16,395 INFO L87 Difference]: Start difference. First operand 7440 states and 9289 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:26:17,659 INFO L93 Difference]: Finished difference Result 13663 states and 17103 transitions. [2021-10-13 01:26:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:26:17,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:26:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:26:17,669 INFO L225 Difference]: With dead ends: 13663 [2021-10-13 01:26:17,669 INFO L226 Difference]: Without dead ends: 7440 [2021-10-13 01:26:17,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:26:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2021-10-13 01:26:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2021-10-13 01:26:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7440 states, 7439 states have (on average 1.2450598198682619) internal successors, (9262), 7439 states have internal predecessors, (9262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 9262 transitions. [2021-10-13 01:26:19,051 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 9262 transitions. Word has length 268 [2021-10-13 01:26:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:26:19,052 INFO L470 AbstractCegarLoop]: Abstraction has 7440 states and 9262 transitions. [2021-10-13 01:26:19,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:26:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 9262 transitions. [2021-10-13 01:26:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:26:19,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:26:19,065 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:26:19,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-13 01:26:19,066 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:26:19,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:26:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1955661567, now seen corresponding path program 1 times [2021-10-13 01:26:19,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:26:19,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943703985] [2021-10-13 01:26:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:26:19,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:26:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:26:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:26:19,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:26:19,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943703985] [2021-10-13 01:26:19,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943703985] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:26:19,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286377821] [2021-10-13 01:26:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:26:19,394 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:26:19,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:26:19,395 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:26:19,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 01:26:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:26:20,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-13 01:26:20,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:26:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:26:21,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286377821] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:26:21,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:26:21,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-13 01:26:21,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873933528] [2021-10-13 01:26:21,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 01:26:21,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:26:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 01:26:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:26:21,945 INFO L87 Difference]: Start difference. First operand 7440 states and 9262 transitions. Second operand has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:27:00,052 INFO L93 Difference]: Finished difference Result 115635 states and 148560 transitions. [2021-10-13 01:27:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2021-10-13 01:27:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:27:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:27:00,202 INFO L225 Difference]: With dead ends: 115635 [2021-10-13 01:27:00,202 INFO L226 Difference]: Without dead ends: 110341 [2021-10-13 01:27:00,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76900 ImplicationChecksByTransitivity, 11858.8ms TimeCoverageRelationStatistics Valid=15860, Invalid=169470, Unknown=0, NotChecked=0, Total=185330 [2021-10-13 01:27:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110341 states. [2021-10-13 01:27:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110341 to 10475. [2021-10-13 01:27:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10474 states have (on average 1.2468016039717396) internal successors, (13059), 10474 states have internal predecessors, (13059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 13059 transitions. [2021-10-13 01:27:02,999 INFO L78 Accepts]: Start accepts. Automaton has 10475 states and 13059 transitions. Word has length 268 [2021-10-13 01:27:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:27:03,000 INFO L470 AbstractCegarLoop]: Abstraction has 10475 states and 13059 transitions. [2021-10-13 01:27:03,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.875) internal successors, (380), 31 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 10475 states and 13059 transitions. [2021-10-13 01:27:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-10-13 01:27:03,014 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:27:03,014 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:27:03,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-10-13 01:27:03,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-10-13 01:27:03,215 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:27:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:27:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1410788993, now seen corresponding path program 1 times [2021-10-13 01:27:03,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:27:03,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658185914] [2021-10-13 01:27:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:27:03,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:27:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:27:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-10-13 01:27:03,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:27:03,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658185914] [2021-10-13 01:27:03,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658185914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:27:03,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:27:03,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:27:03,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299684488] [2021-10-13 01:27:03,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:27:03,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:27:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:27:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:27:03,364 INFO L87 Difference]: Start difference. First operand 10475 states and 13059 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:27:05,048 INFO L93 Difference]: Finished difference Result 19622 states and 24627 transitions. [2021-10-13 01:27:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:27:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2021-10-13 01:27:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:27:05,057 INFO L225 Difference]: With dead ends: 19622 [2021-10-13 01:27:05,057 INFO L226 Difference]: Without dead ends: 10162 [2021-10-13 01:27:05,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:27:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2021-10-13 01:27:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 10162. [2021-10-13 01:27:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10161 states have (on average 1.2483023324475937) internal successors, (12684), 10161 states have internal predecessors, (12684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 12684 transitions. [2021-10-13 01:27:06,768 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 12684 transitions. Word has length 268 [2021-10-13 01:27:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:27:06,769 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 12684 transitions. [2021-10-13 01:27:06,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:27:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 12684 transitions. [2021-10-13 01:27:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-13 01:27:06,790 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:27:06,790 INFO L512 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] [2021-10-13 01:27:06,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-13 01:27:06,792 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:27:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:27:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash 632679647, now seen corresponding path program 1 times [2021-10-13 01:27:06,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:27:06,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003382349] [2021-10-13 01:27:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:27:06,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:27:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:27:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:27:07,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:27:07,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003382349] [2021-10-13 01:27:07,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003382349] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:27:07,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584135955] [2021-10-13 01:27:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:27:07,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:27:07,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:27:07,182 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:27:07,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 01:27:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:27:08,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-13 01:27:08,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:27:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:27:09,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584135955] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:27:09,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:27:09,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-10-13 01:27:09,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889157600] [2021-10-13 01:27:09,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 01:27:09,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:27:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 01:27:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-13 01:27:09,502 INFO L87 Difference]: Start difference. First operand 10162 states and 12684 transitions. Second operand has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:28:01,393 INFO L93 Difference]: Finished difference Result 130069 states and 167788 transitions. [2021-10-13 01:28:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-10-13 01:28:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2021-10-13 01:28:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:28:01,563 INFO L225 Difference]: With dead ends: 130069 [2021-10-13 01:28:01,564 INFO L226 Difference]: Without dead ends: 121112 [2021-10-13 01:28:01,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92538 ImplicationChecksByTransitivity, 17335.7ms TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-10-13 01:28:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121112 states. [2021-10-13 01:28:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121112 to 10240. [2021-10-13 01:28:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 1.2502197480222679) internal successors, (12801), 10239 states have internal predecessors, (12801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 12801 transitions. [2021-10-13 01:28:04,466 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 12801 transitions. Word has length 269 [2021-10-13 01:28:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:28:04,467 INFO L470 AbstractCegarLoop]: Abstraction has 10240 states and 12801 transitions. [2021-10-13 01:28:04,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 12801 transitions. [2021-10-13 01:28:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-13 01:28:04,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:28:04,480 INFO L512 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] [2021-10-13 01:28:04,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-13 01:28:04,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-10-13 01:28:04,686 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:28:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:28:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1579717533, now seen corresponding path program 1 times [2021-10-13 01:28:04,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:28:04,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304699197] [2021-10-13 01:28:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:04,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:28:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:28:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-13 01:28:04,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:28:04,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304699197] [2021-10-13 01:28:04,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304699197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:28:04,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:28:04,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:28:04,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813015709] [2021-10-13 01:28:04,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:28:04,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:28:04,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:28:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:28:04,812 INFO L87 Difference]: Start difference. First operand 10240 states and 12801 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:28:07,232 INFO L93 Difference]: Finished difference Result 19704 states and 24735 transitions. [2021-10-13 01:28:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:28:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2021-10-13 01:28:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:28:07,241 INFO L225 Difference]: With dead ends: 19704 [2021-10-13 01:28:07,241 INFO L226 Difference]: Without dead ends: 10279 [2021-10-13 01:28:07,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:28:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2021-10-13 01:28:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 10162. [2021-10-13 01:28:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 10161 states have (on average 1.2483023324475937) internal successors, (12684), 10161 states have internal predecessors, (12684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 12684 transitions. [2021-10-13 01:28:09,588 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 12684 transitions. Word has length 269 [2021-10-13 01:28:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:28:09,589 INFO L470 AbstractCegarLoop]: Abstraction has 10162 states and 12684 transitions. [2021-10-13 01:28:09,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 12684 transitions. [2021-10-13 01:28:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-10-13 01:28:09,597 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:28:09,597 INFO L512 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] [2021-10-13 01:28:09,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-13 01:28:09,597 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:28:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:28:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 203021341, now seen corresponding path program 1 times [2021-10-13 01:28:09,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:28:09,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075942511] [2021-10-13 01:28:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:09,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:28:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:28:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-13 01:28:09,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:28:09,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075942511] [2021-10-13 01:28:09,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075942511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:28:09,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:28:09,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:28:09,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889762472] [2021-10-13 01:28:09,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:28:09,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:28:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:28:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:28:09,682 INFO L87 Difference]: Start difference. First operand 10162 states and 12684 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:28:11,347 INFO L93 Difference]: Finished difference Result 16459 states and 20685 transitions. [2021-10-13 01:28:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:28:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2021-10-13 01:28:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:28:11,353 INFO L225 Difference]: With dead ends: 16459 [2021-10-13 01:28:11,353 INFO L226 Difference]: Without dead ends: 7070 [2021-10-13 01:28:11,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:28:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2021-10-13 01:28:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 7070. [2021-10-13 01:28:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 7069 states have (on average 1.2485500070731361) internal successors, (8826), 7069 states have internal predecessors, (8826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 8826 transitions. [2021-10-13 01:28:12,888 INFO L78 Accepts]: Start accepts. Automaton has 7070 states and 8826 transitions. Word has length 269 [2021-10-13 01:28:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:28:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 7070 states and 8826 transitions. [2021-10-13 01:28:12,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7070 states and 8826 transitions. [2021-10-13 01:28:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2021-10-13 01:28:12,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:28:12,895 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:28:12,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-13 01:28:12,895 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:28:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:28:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1098291723, now seen corresponding path program 1 times [2021-10-13 01:28:12,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:28:12,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194128764] [2021-10-13 01:28:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:12,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:28:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:28:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-10-13 01:28:13,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:28:13,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194128764] [2021-10-13 01:28:13,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194128764] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:28:13,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804092909] [2021-10-13 01:28:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:13,111 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:28:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:28:13,114 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:28:13,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-13 01:28:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:28:14,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-13 01:28:14,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:28:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-10-13 01:28:14,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804092909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:28:14,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:28:14,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2021-10-13 01:28:14,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572313092] [2021-10-13 01:28:14,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:28:14,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:28:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:28:14,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2021-10-13 01:28:14,914 INFO L87 Difference]: Start difference. First operand 7070 states and 8826 transitions. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:28:21,119 INFO L93 Difference]: Finished difference Result 24601 states and 31427 transitions. [2021-10-13 01:28:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-13 01:28:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2021-10-13 01:28:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:28:21,136 INFO L225 Difference]: With dead ends: 24601 [2021-10-13 01:28:21,136 INFO L226 Difference]: Without dead ends: 18538 [2021-10-13 01:28:21,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 376.2ms TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 01:28:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18538 states. [2021-10-13 01:28:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18538 to 6722. [2021-10-13 01:28:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6722 states, 6721 states have (on average 1.25591429846749) internal successors, (8441), 6721 states have internal predecessors, (8441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6722 states to 6722 states and 8441 transitions. [2021-10-13 01:28:22,754 INFO L78 Accepts]: Start accepts. Automaton has 6722 states and 8441 transitions. Word has length 270 [2021-10-13 01:28:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:28:22,754 INFO L470 AbstractCegarLoop]: Abstraction has 6722 states and 8441 transitions. [2021-10-13 01:28:22,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6722 states and 8441 transitions. [2021-10-13 01:28:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-10-13 01:28:22,759 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:28:22,759 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:28:22,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-13 01:28:22,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:28:22,960 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:28:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:28:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash 109258159, now seen corresponding path program 1 times [2021-10-13 01:28:22,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:28:22,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36746232] [2021-10-13 01:28:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:22,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:28:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:28:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-10-13 01:28:23,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:28:23,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36746232] [2021-10-13 01:28:23,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36746232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:28:23,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:28:23,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:28:23,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738741011] [2021-10-13 01:28:23,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:28:23,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:28:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:28:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:28:23,056 INFO L87 Difference]: Start difference. First operand 6722 states and 8441 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:28:26,419 INFO L93 Difference]: Finished difference Result 17080 states and 21613 transitions. [2021-10-13 01:28:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:28:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-10-13 01:28:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:28:26,431 INFO L225 Difference]: With dead ends: 17080 [2021-10-13 01:28:26,431 INFO L226 Difference]: Without dead ends: 11017 [2021-10-13 01:28:26,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:28:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2021-10-13 01:28:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 6682. [2021-10-13 01:28:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6682 states, 6681 states have (on average 1.2544529262086515) internal successors, (8381), 6681 states have internal predecessors, (8381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6682 states to 6682 states and 8381 transitions. [2021-10-13 01:28:28,029 INFO L78 Accepts]: Start accepts. Automaton has 6682 states and 8381 transitions. Word has length 271 [2021-10-13 01:28:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:28:28,029 INFO L470 AbstractCegarLoop]: Abstraction has 6682 states and 8381 transitions. [2021-10-13 01:28:28,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:28:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6682 states and 8381 transitions. [2021-10-13 01:28:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-10-13 01:28:28,034 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:28:28,034 INFO L512 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] [2021-10-13 01:28:28,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-13 01:28:28,034 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-10-13 01:28:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:28:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1649321138, now seen corresponding path program 1 times [2021-10-13 01:28:28,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:28:28,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676497334] [2021-10-13 01:28:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:28:28,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:28:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:28:28,097 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:28:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:28:28,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:28:28,295 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:28:28,296 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,297 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,298 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,301 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,301 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,301 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,301 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,301 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,304 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,304 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,304 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,304 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,304 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:28:28,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-13 01:28:28,312 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:28:28,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:28:28 BoogieIcfgContainer [2021-10-13 01:28:28,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:28:28,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:28:28,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:28:28,607 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:28:28,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:37" (3/4) ... [2021-10-13 01:28:28,609 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:28:28,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:28:28,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:28:28,912 INFO L168 Benchmark]: Toolchain (without parser) took 233458.09 ms. Allocated memory was 127.9 MB in the beginning and 6.0 GB in the end (delta: 5.9 GB). Free memory was 94.8 MB in the beginning and 5.1 GB in the end (delta: -5.0 GB). Peak memory consumption was 926.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,913 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 88.1 MB. Free memory is still 44.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:28:28,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.24 ms. Allocated memory is still 127.9 MB. Free memory was 94.5 MB in the beginning and 98.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.76 ms. Allocated memory is still 127.9 MB. Free memory was 98.2 MB in the beginning and 92.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,914 INFO L168 Benchmark]: Boogie Preprocessor took 109.07 ms. Allocated memory is still 127.9 MB. Free memory was 92.0 MB in the beginning and 86.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,915 INFO L168 Benchmark]: RCFGBuilder took 1561.87 ms. Allocated memory is still 127.9 MB. Free memory was 86.9 MB in the beginning and 80.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 47.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,915 INFO L168 Benchmark]: TraceAbstraction took 230985.04 ms. Allocated memory was 127.9 MB in the beginning and 6.0 GB in the end (delta: 5.9 GB). Free memory was 79.6 MB in the beginning and 5.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 844.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,915 INFO L168 Benchmark]: Witness Printer took 303.87 ms. Allocated memory is still 6.0 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 66.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:28:28,917 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.25 ms. Allocated memory is still 88.1 MB. Free memory is still 44.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 381.24 ms. Allocated memory is still 127.9 MB. Free memory was 94.5 MB in the beginning and 98.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.76 ms. Allocated memory is still 127.9 MB. Free memory was 98.2 MB in the beginning and 92.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.07 ms. Allocated memory is still 127.9 MB. Free memory was 92.0 MB in the beginning and 86.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1561.87 ms. Allocated memory is still 127.9 MB. Free memory was 86.9 MB in the beginning and 80.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 47.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 230985.04 ms. Allocated memory was 127.9 MB in the beginning and 6.0 GB in the end (delta: 5.9 GB). Free memory was 79.6 MB in the beginning and 5.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 844.4 MB. Max. memory is 16.1 GB. * Witness Printer took 303.87 ms. Allocated memory is still 6.0 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 66.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 535]: a call to reach_error is reachable a call to reach_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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] [L535] 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] - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 518 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 230619.2ms, OverallIterations: 56, TraceHistogramMax: 3, EmptinessCheckTime: 234.8ms, AutomataDifference: 178528.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 29969 SDtfs, 49627 SDslu, 198453 SDs, 0 SdLazy, 67816 SolverSat, 1454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24881.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5185 GetRequests, 2939 SyntacticMatches, 4 SemanticMatches, 2242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303424 ImplicationChecksByTransitivity, 64532.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10475occurred in iteration=49, InterpolantAutomatonStates: 2119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 21484.9ms AutomataMinimizationTime, 55 MinimizatonAttempts, 312019 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 822.1ms SsaConstructionTime, 2955.8ms SatisfiabilityAnalysisTime, 16669.7ms InterpolantComputationTime, 12164 NumberOfCodeBlocks, 12164 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11821 ConstructedInterpolants, 0 QuantifiedInterpolants, 37104 SizeOfPredicates, 88 NumberOfNonLiveVariables, 12201 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 68 InterpolantComputations, 44 PerfectInterpolantSequences, 6662/7322 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:28:28,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cfeec5-1dbf-4326-a8e1-c9a1db742fa1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...