./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --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_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/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_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/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_6f389a62-b59e-4cd3-9306-7cd45f929e43/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 081154e787322e3b9ad682661fd03964eab6d0d9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:01:58,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:01:58,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:01:58,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:01:58,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:01:58,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:01:58,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:01:58,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:01:58,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:01:58,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:01:58,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:01:58,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:01:58,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:01:58,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:01:58,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:01:58,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:01:58,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:01:58,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:01:58,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:01:58,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:01:58,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:01:58,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:01:58,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:01:58,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:01:58,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:01:58,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:01:58,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:01:58,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:01:58,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:01:58,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:01:58,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:01:58,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:01:58,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:01:58,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:01:58,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:01:58,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:01:58,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:01:58,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:01:58,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:01:58,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:01:58,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:01:58,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:01:58,167 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:01:58,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:01:58,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:01:58,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:01:58,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:01:58,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:01:58,176 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:01:58,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:01:58,176 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:01:58,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:01:58,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:01:58,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:01:58,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:01:58,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:01:58,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:01:58,179 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:01:58,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:01:58,179 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:01:58,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:01:58,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:01:58,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:01:58,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:01:58,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:01:58,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:01:58,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:01:58,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:01:58,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:01:58,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:01:58,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:01:58,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:01:58,183 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_6f389a62-b59e-4cd3-9306-7cd45f929e43/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_6f389a62-b59e-4cd3-9306-7cd45f929e43/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 -> 081154e787322e3b9ad682661fd03964eab6d0d9 [2021-10-13 00:01:58,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:01:58,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:01:58,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:01:58,494 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:01:58,495 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:01:58,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-10-13 00:01:58,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/data/71cc82771/5d8dbedfa3634966bafde4bfc31d3db1/FLAGc0280e3d8 [2021-10-13 00:01:59,203 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:01:59,208 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-10-13 00:01:59,240 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/data/71cc82771/5d8dbedfa3634966bafde4bfc31d3db1/FLAGc0280e3d8 [2021-10-13 00:01:59,428 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/data/71cc82771/5d8dbedfa3634966bafde4bfc31d3db1 [2021-10-13 00:01:59,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:01:59,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:01:59,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:01:59,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:01:59,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:01:59,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:59" (1/1) ... [2021-10-13 00:01:59,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78359d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:59, skipping insertion in model container [2021-10-13 00:01:59,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:59" (1/1) ... [2021-10-13 00:01:59,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:01:59,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:02:00,350 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_6f389a62-b59e-4cd3-9306-7cd45f929e43/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-10-13 00:02:00,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:02:00,398 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:02:00,465 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_6f389a62-b59e-4cd3-9306-7cd45f929e43/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-10-13 00:02:00,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:02:00,636 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:02:00,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00 WrapperNode [2021-10-13 00:02:00,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:02:00,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:02:00,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:02:00,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:02:00,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:02:00,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:02:00,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:02:00,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:02:00,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:02:00,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:02:00,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:02:00,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:02:00,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (1/1) ... [2021-10-13 00:02:00,854 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:02:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:02:00,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:02:00,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:02:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:02:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:02:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-13 00:02:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:02:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:02:00,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:02:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-10-13 00:02:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-10-13 00:02:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:02:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:02:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:02:00,948 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 00:02:01,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:02:01,457 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-10-13 00:02:01,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:01 BoogieIcfgContainer [2021-10-13 00:02:01,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:02:01,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:02:01,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:02:01,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:02:01,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:01:59" (1/3) ... [2021-10-13 00:02:01,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f9763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:01, skipping insertion in model container [2021-10-13 00:02:01,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:00" (2/3) ... [2021-10-13 00:02:01,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f9763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:01, skipping insertion in model container [2021-10-13 00:02:01,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:01" (3/3) ... [2021-10-13 00:02:01,468 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-10-13 00:02:01,473 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 00:02:01,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:02:01,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-10-13 00:02:01,474 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 00:02:01,510 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,511 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,511 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,512 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,512 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,513 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,514 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,515 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,515 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,515 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,515 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,515 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,516 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,517 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,518 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,519 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,519 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,519 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,520 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,520 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,520 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,521 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,522 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,522 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,522 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,523 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,523 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,523 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,523 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,523 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,524 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,524 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,524 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,525 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,525 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,525 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,525 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,525 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,526 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,526 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,526 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,527 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,527 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,527 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,527 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,527 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,528 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,528 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,529 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,529 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,529 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,529 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,529 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,530 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,530 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,530 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,530 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,531 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,531 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,531 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,531 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,531 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,532 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,533 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,534 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,534 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,534 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,534 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,535 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,535 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,535 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,535 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,535 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,536 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,536 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,537 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,537 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,538 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,538 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,538 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,539 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,539 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,539 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,539 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,540 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,540 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,540 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,540 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,541 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,541 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,541 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,541 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,542 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,545 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,545 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,546 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,546 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,546 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,546 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,547 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,547 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,547 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,547 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,547 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,548 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,553 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,553 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,554 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,554 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,554 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,554 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,555 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,555 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,555 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,555 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,555 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,556 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:02:01,563 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-13 00:02:01,634 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:02:01,640 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 00:02:01,640 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-10-13 00:02:01,660 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 00:02:01,671 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 169 transitions, 354 flow [2021-10-13 00:02:01,674 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 169 transitions, 354 flow [2021-10-13 00:02:01,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 354 flow [2021-10-13 00:02:01,758 INFO L129 PetriNetUnfolder]: 10/205 cut-off events. [2021-10-13 00:02:01,759 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 00:02:01,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 10/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-10-13 00:02:01,780 INFO L116 LiptonReduction]: Number of co-enabled transitions 2996 [2021-10-13 00:02:48,966 INFO L131 LiptonReduction]: Checked pairs total: 6296 [2021-10-13 00:02:48,967 INFO L133 LiptonReduction]: Total number of compositions: 191 [2021-10-13 00:02:48,976 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 35 transitions, 86 flow [2021-10-13 00:02:49,026 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 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 00:02:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 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 00:02:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-13 00:02:49,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:49,038 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-13 00:02:49,038 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2021-10-13 00:02:49,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:49,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321259270] [2021-10-13 00:02:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:49,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:49,359 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 00:02:49,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:49,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321259270] [2021-10-13 00:02:49,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321259270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:49,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:49,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-13 00:02:49,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256313926] [2021-10-13 00:02:49,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 00:02:49,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 00:02:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:02:49,391 INFO L87 Difference]: Start difference. First operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 00:02:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:49,432 INFO L93 Difference]: Finished difference Result 366 states and 896 transitions. [2021-10-13 00:02:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 00:02:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-10-13 00:02:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:49,452 INFO L225 Difference]: With dead ends: 366 [2021-10-13 00:02:49,452 INFO L226 Difference]: Without dead ends: 329 [2021-10-13 00:02:49,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:02:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-10-13 00:02:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-10-13 00:02:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 323 states have (on average 2.473684210526316) internal successors, (799), 328 states have internal predecessors, (799), 0 states have call successors, (0), 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 00:02:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 799 transitions. [2021-10-13 00:02:49,533 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 799 transitions. Word has length 1 [2021-10-13 00:02:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:49,533 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 799 transitions. [2021-10-13 00:02:49,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 00:02:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 799 transitions. [2021-10-13 00:02:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 00:02:49,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:49,535 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 00:02:49,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:02:49,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash 583278121, now seen corresponding path program 1 times [2021-10-13 00:02:49,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:49,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251494892] [2021-10-13 00:02:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:49,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:49,918 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 00:02:49,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:49,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251494892] [2021-10-13 00:02:49,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251494892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:49,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:49,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:02:49,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177544452] [2021-10-13 00:02:49,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:02:49,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:02:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:02:49,923 INFO L87 Difference]: Start difference. First operand 329 states and 799 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 00:02:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:50,082 INFO L93 Difference]: Finished difference Result 484 states and 1174 transitions. [2021-10-13 00:02:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:02:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-13 00:02:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:50,090 INFO L225 Difference]: With dead ends: 484 [2021-10-13 00:02:50,091 INFO L226 Difference]: Without dead ends: 484 [2021-10-13 00:02:50,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:02:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-10-13 00:02:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 420. [2021-10-13 00:02:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 2.5012048192771084) internal successors, (1038), 419 states have internal predecessors, (1038), 0 states have call successors, (0), 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 00:02:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1038 transitions. [2021-10-13 00:02:50,127 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1038 transitions. Word has length 5 [2021-10-13 00:02:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:50,128 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1038 transitions. [2021-10-13 00:02:50,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 00:02:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1038 transitions. [2021-10-13 00:02:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 00:02:50,129 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:50,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 00:02:50,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:02:50,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:50,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash 583278192, now seen corresponding path program 1 times [2021-10-13 00:02:50,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:50,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119863435] [2021-10-13 00:02:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:50,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:50,279 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 00:02:50,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:50,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119863435] [2021-10-13 00:02:50,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119863435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:50,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:50,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:02:50,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483231073] [2021-10-13 00:02:50,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:02:50,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:02:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:02:50,283 INFO L87 Difference]: Start difference. First operand 420 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 00:02:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:50,383 INFO L93 Difference]: Finished difference Result 543 states and 1297 transitions. [2021-10-13 00:02:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:02:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-13 00:02:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:50,390 INFO L225 Difference]: With dead ends: 543 [2021-10-13 00:02:50,390 INFO L226 Difference]: Without dead ends: 527 [2021-10-13 00:02:50,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:02:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-10-13 00:02:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 495. [2021-10-13 00:02:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 491 states have (on average 2.476578411405295) internal successors, (1216), 494 states have internal predecessors, (1216), 0 states have call successors, (0), 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 00:02:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1216 transitions. [2021-10-13 00:02:50,432 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1216 transitions. Word has length 5 [2021-10-13 00:02:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:50,432 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1216 transitions. [2021-10-13 00:02:50,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 00:02:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1216 transitions. [2021-10-13 00:02:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:02:50,439 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:50,439 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:02:50,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:02:50,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -987483982, now seen corresponding path program 1 times [2021-10-13 00:02:50,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:50,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981926355] [2021-10-13 00:02:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:50,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:50,527 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 00:02:50,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:50,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981926355] [2021-10-13 00:02:50,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981926355] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:50,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:50,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:02:50,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325998086] [2021-10-13 00:02:50,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:02:50,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:02:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:02:50,531 INFO L87 Difference]: Start difference. First operand 495 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:02:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:50,551 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2021-10-13 00:02:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:02:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 00:02:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:50,554 INFO L225 Difference]: With dead ends: 143 [2021-10-13 00:02:50,554 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 00:02:50,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:02:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 00:02:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-10-13 00:02:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 0 states have call successors, (0), 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 00:02:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2021-10-13 00:02:50,562 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 11 [2021-10-13 00:02:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:50,563 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2021-10-13 00:02:50,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:02:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2021-10-13 00:02:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:50,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:50,566 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 00:02:50,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:02:50,566 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -229818472, now seen corresponding path program 1 times [2021-10-13 00:02:50,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:50,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639080006] [2021-10-13 00:02:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:50,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:52,102 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 00:02:52,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:52,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639080006] [2021-10-13 00:02:52,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639080006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:52,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:52,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:02:52,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001429539] [2021-10-13 00:02:52,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:02:52,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:02:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:02:52,105 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:02:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:53,994 INFO L93 Difference]: Finished difference Result 236 states and 476 transitions. [2021-10-13 00:02:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 00:02:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:02:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:53,997 INFO L225 Difference]: With dead ends: 236 [2021-10-13 00:02:53,997 INFO L226 Difference]: Without dead ends: 236 [2021-10-13 00:02:53,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1396.6ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-10-13 00:02:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-13 00:02:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 162. [2021-10-13 00:02:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.11875) internal successors, (339), 161 states have internal predecessors, (339), 0 states have call successors, (0), 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 00:02:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 339 transitions. [2021-10-13 00:02:54,006 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 339 transitions. Word has length 21 [2021-10-13 00:02:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:54,006 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 339 transitions. [2021-10-13 00:02:54,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:02:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 339 transitions. [2021-10-13 00:02:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:54,016 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:54,016 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 00:02:54,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:02:54,017 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash -229818501, now seen corresponding path program 1 times [2021-10-13 00:02:54,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:54,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247557830] [2021-10-13 00:02:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:54,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:02:54,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:54,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247557830] [2021-10-13 00:02:54,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247557830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:54,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:54,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:02:54,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194285327] [2021-10-13 00:02:54,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:02:54,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:54,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:02:54,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:02:54,531 INFO L87 Difference]: Start difference. First operand 162 states and 339 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:54,938 INFO L93 Difference]: Finished difference Result 226 states and 444 transitions. [2021-10-13 00:02:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:02:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:02:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:54,941 INFO L225 Difference]: With dead ends: 226 [2021-10-13 00:02:54,941 INFO L226 Difference]: Without dead ends: 207 [2021-10-13 00:02:54,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 272.4ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:02:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-10-13 00:02:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 164. [2021-10-13 00:02:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.111111111111111) internal successors, (342), 163 states have internal predecessors, (342), 0 states have call successors, (0), 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 00:02:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 342 transitions. [2021-10-13 00:02:54,949 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 342 transitions. Word has length 21 [2021-10-13 00:02:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:54,950 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 342 transitions. [2021-10-13 00:02:54,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 342 transitions. [2021-10-13 00:02:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:54,951 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:54,951 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 00:02:54,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:02:54,952 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 538676892, now seen corresponding path program 2 times [2021-10-13 00:02:54,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:54,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718481368] [2021-10-13 00:02:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:54,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:56,142 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 00:02:56,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:56,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718481368] [2021-10-13 00:02:56,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718481368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:56,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:56,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:02:56,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28537935] [2021-10-13 00:02:56,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:02:56,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:02:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:02:56,145 INFO L87 Difference]: Start difference. First operand 164 states and 342 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:02:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:57,903 INFO L93 Difference]: Finished difference Result 256 states and 520 transitions. [2021-10-13 00:02:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 00:02:57,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:02:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:57,906 INFO L225 Difference]: With dead ends: 256 [2021-10-13 00:02:57,907 INFO L226 Difference]: Without dead ends: 256 [2021-10-13 00:02:57,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1423.2ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-10-13 00:02:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-13 00:02:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 189. [2021-10-13 00:02:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 2.064171122994652) internal successors, (386), 188 states have internal predecessors, (386), 0 states have call successors, (0), 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 00:02:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 386 transitions. [2021-10-13 00:02:57,917 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 386 transitions. Word has length 21 [2021-10-13 00:02:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:57,918 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 386 transitions. [2021-10-13 00:02:57,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:02:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 386 transitions. [2021-10-13 00:02:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:57,920 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:57,920 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 00:02:57,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:02:57,921 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 538676863, now seen corresponding path program 2 times [2021-10-13 00:02:57,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:57,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29295579] [2021-10-13 00:02:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:57,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:58,381 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 00:02:58,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:58,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29295579] [2021-10-13 00:02:58,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29295579] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:58,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:58,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:02:58,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300823754] [2021-10-13 00:02:58,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:02:58,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:02:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:02:58,385 INFO L87 Difference]: Start difference. First operand 189 states and 386 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:58,685 INFO L93 Difference]: Finished difference Result 292 states and 553 transitions. [2021-10-13 00:02:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:02:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:02:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:58,689 INFO L225 Difference]: With dead ends: 292 [2021-10-13 00:02:58,689 INFO L226 Difference]: Without dead ends: 275 [2021-10-13 00:02:58,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:02:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-10-13 00:02:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 181. [2021-10-13 00:02:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.0670391061452515) internal successors, (370), 180 states have internal predecessors, (370), 0 states have call successors, (0), 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 00:02:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 370 transitions. [2021-10-13 00:02:58,699 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 370 transitions. Word has length 21 [2021-10-13 00:02:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:58,699 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 370 transitions. [2021-10-13 00:02:58,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 370 transitions. [2021-10-13 00:02:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:58,701 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:58,701 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 00:02:58,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:02:58,702 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1665260969, now seen corresponding path program 3 times [2021-10-13 00:02:58,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:58,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075849989] [2021-10-13 00:02:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:58,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:02:59,147 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 00:02:59,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:02:59,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075849989] [2021-10-13 00:02:59,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075849989] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:02:59,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:02:59,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:02:59,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023945644] [2021-10-13 00:02:59,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:02:59,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:02:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:02:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:02:59,150 INFO L87 Difference]: Start difference. First operand 181 states and 370 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:02:59,488 INFO L93 Difference]: Finished difference Result 297 states and 613 transitions. [2021-10-13 00:02:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:02:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:02:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:02:59,490 INFO L225 Difference]: With dead ends: 297 [2021-10-13 00:02:59,490 INFO L226 Difference]: Without dead ends: 282 [2021-10-13 00:02:59,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 219.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:02:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-13 00:02:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 182. [2021-10-13 00:02:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.1277777777777778) internal successors, (383), 181 states have internal predecessors, (383), 0 states have call successors, (0), 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 00:02:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 383 transitions. [2021-10-13 00:02:59,500 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 383 transitions. Word has length 21 [2021-10-13 00:02:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:02:59,500 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 383 transitions. [2021-10-13 00:02:59,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:02:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 383 transitions. [2021-10-13 00:02:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:02:59,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:02:59,502 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 00:02:59,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:02:59,503 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:02:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:02:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -160369218, now seen corresponding path program 3 times [2021-10-13 00:02:59,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:02:59,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892388995] [2021-10-13 00:02:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:02:59,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:02:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:00,668 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 00:03:00,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:00,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892388995] [2021-10-13 00:03:00,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892388995] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:00,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:00,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:00,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382406855] [2021-10-13 00:03:00,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:00,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:00,671 INFO L87 Difference]: Start difference. First operand 182 states and 383 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:02,639 INFO L93 Difference]: Finished difference Result 268 states and 547 transitions. [2021-10-13 00:03:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-13 00:03:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:02,642 INFO L225 Difference]: With dead ends: 268 [2021-10-13 00:03:02,642 INFO L226 Difference]: Without dead ends: 255 [2021-10-13 00:03:02,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1497.1ms TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2021-10-13 00:03:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-13 00:03:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 186. [2021-10-13 00:03:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.125) internal successors, (391), 185 states have internal predecessors, (391), 0 states have call successors, (0), 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 00:03:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 391 transitions. [2021-10-13 00:03:02,660 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 391 transitions. Word has length 21 [2021-10-13 00:03:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:02,660 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 391 transitions. [2021-10-13 00:03:02,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 391 transitions. [2021-10-13 00:03:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:02,662 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:02,662 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 00:03:02,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:03:02,662 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -385945758, now seen corresponding path program 4 times [2021-10-13 00:03:02,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:02,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734672101] [2021-10-13 00:03:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:02,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:03,764 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 00:03:03,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:03,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734672101] [2021-10-13 00:03:03,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734672101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:03,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:03,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:03,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237755116] [2021-10-13 00:03:03,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:03,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:03,767 INFO L87 Difference]: Start difference. First operand 186 states and 391 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:05,520 INFO L93 Difference]: Finished difference Result 272 states and 551 transitions. [2021-10-13 00:03:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 00:03:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:05,524 INFO L225 Difference]: With dead ends: 272 [2021-10-13 00:03:05,524 INFO L226 Difference]: Without dead ends: 237 [2021-10-13 00:03:05,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1378.6ms TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2021-10-13 00:03:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-13 00:03:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2021-10-13 00:03:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 2.125) internal successors, (357), 169 states have internal predecessors, (357), 0 states have call successors, (0), 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 00:03:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 357 transitions. [2021-10-13 00:03:05,533 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 357 transitions. Word has length 21 [2021-10-13 00:03:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:05,533 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 357 transitions. [2021-10-13 00:03:05,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 357 transitions. [2021-10-13 00:03:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:05,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:05,535 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 00:03:05,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:03:05,536 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1751979318, now seen corresponding path program 5 times [2021-10-13 00:03:05,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:05,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438800295] [2021-10-13 00:03:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:05,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:06,595 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 00:03:06,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:06,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438800295] [2021-10-13 00:03:06,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438800295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:06,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:06,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:06,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395739725] [2021-10-13 00:03:06,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:06,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:06,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:06,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:06,597 INFO L87 Difference]: Start difference. First operand 170 states and 357 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:08,347 INFO L93 Difference]: Finished difference Result 264 states and 529 transitions. [2021-10-13 00:03:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 00:03:08,348 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:08,350 INFO L225 Difference]: With dead ends: 264 [2021-10-13 00:03:08,350 INFO L226 Difference]: Without dead ends: 245 [2021-10-13 00:03:08,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1391.8ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-10-13 00:03:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-13 00:03:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 171. [2021-10-13 00:03:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.1183431952662723) internal successors, (358), 170 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 00:03:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 358 transitions. [2021-10-13 00:03:08,360 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 358 transitions. Word has length 21 [2021-10-13 00:03:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:08,360 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 358 transitions. [2021-10-13 00:03:08,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 358 transitions. [2021-10-13 00:03:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:08,363 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:08,363 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 00:03:08,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:03:08,364 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1746334808, now seen corresponding path program 6 times [2021-10-13 00:03:08,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:08,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355977404] [2021-10-13 00:03:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:08,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:08,578 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 00:03:08,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:08,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355977404] [2021-10-13 00:03:08,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355977404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:08,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:08,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:03:08,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081209820] [2021-10-13 00:03:08,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:03:08,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:08,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:03:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:03:08,581 INFO L87 Difference]: Start difference. First operand 171 states and 358 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:08,703 INFO L93 Difference]: Finished difference Result 195 states and 391 transitions. [2021-10-13 00:03:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:03:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 21 [2021-10-13 00:03:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:08,706 INFO L225 Difference]: With dead ends: 195 [2021-10-13 00:03:08,706 INFO L226 Difference]: Without dead ends: 192 [2021-10-13 00:03:08,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 105.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-13 00:03:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2021-10-13 00:03:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.066265060240964) internal successors, (343), 167 states have internal predecessors, (343), 0 states have call successors, (0), 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 00:03:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 343 transitions. [2021-10-13 00:03:08,714 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 343 transitions. Word has length 21 [2021-10-13 00:03:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:08,715 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 343 transitions. [2021-10-13 00:03:08,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 343 transitions. [2021-10-13 00:03:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:08,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:08,718 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 00:03:08,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:03:08,719 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1157895652, now seen corresponding path program 7 times [2021-10-13 00:03:08,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:08,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416808918] [2021-10-13 00:03:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:08,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:09,800 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 00:03:09,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:09,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416808918] [2021-10-13 00:03:09,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416808918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:09,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:09,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:09,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509603151] [2021-10-13 00:03:09,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:09,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:09,802 INFO L87 Difference]: Start difference. First operand 168 states and 343 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:11,082 INFO L93 Difference]: Finished difference Result 224 states and 426 transitions. [2021-10-13 00:03:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:11,085 INFO L225 Difference]: With dead ends: 224 [2021-10-13 00:03:11,085 INFO L226 Difference]: Without dead ends: 206 [2021-10-13 00:03:11,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1064.3ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-10-13 00:03:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2021-10-13 00:03:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.067901234567901) internal successors, (335), 163 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:03:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 335 transitions. [2021-10-13 00:03:11,094 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 335 transitions. Word has length 21 [2021-10-13 00:03:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:11,094 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 335 transitions. [2021-10-13 00:03:11,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 335 transitions. [2021-10-13 00:03:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:11,095 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:11,096 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 00:03:11,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:03:11,096 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 309397486, now seen corresponding path program 8 times [2021-10-13 00:03:11,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:11,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336762327] [2021-10-13 00:03:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:11,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:12,030 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 00:03:12,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:12,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336762327] [2021-10-13 00:03:12,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336762327] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:12,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:12,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:12,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691832882] [2021-10-13 00:03:12,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:12,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:12,033 INFO L87 Difference]: Start difference. First operand 164 states and 335 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:13,153 INFO L93 Difference]: Finished difference Result 214 states and 411 transitions. [2021-10-13 00:03:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:13,156 INFO L225 Difference]: With dead ends: 214 [2021-10-13 00:03:13,156 INFO L226 Difference]: Without dead ends: 200 [2021-10-13 00:03:13,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 886.0ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-13 00:03:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 159. [2021-10-13 00:03:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 2.0955414012738856) internal successors, (329), 158 states have internal predecessors, (329), 0 states have call successors, (0), 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 00:03:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 329 transitions. [2021-10-13 00:03:13,165 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 329 transitions. Word has length 21 [2021-10-13 00:03:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:13,165 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 329 transitions. [2021-10-13 00:03:13,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 329 transitions. [2021-10-13 00:03:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:13,167 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:13,167 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 00:03:13,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:03:13,168 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash -502486308, now seen corresponding path program 9 times [2021-10-13 00:03:13,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:13,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614246290] [2021-10-13 00:03:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:13,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:13,390 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 00:03:13,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:13,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614246290] [2021-10-13 00:03:13,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614246290] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:13,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:13,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:03:13,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559411745] [2021-10-13 00:03:13,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:03:13,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:03:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:03:13,392 INFO L87 Difference]: Start difference. First operand 159 states and 329 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:13,528 INFO L93 Difference]: Finished difference Result 171 states and 349 transitions. [2021-10-13 00:03:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:03:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 21 [2021-10-13 00:03:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:13,531 INFO L225 Difference]: With dead ends: 171 [2021-10-13 00:03:13,531 INFO L226 Difference]: Without dead ends: 171 [2021-10-13 00:03:13,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 109.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-10-13 00:03:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-10-13 00:03:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.06508875739645) internal successors, (349), 170 states have internal predecessors, (349), 0 states have call successors, (0), 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 00:03:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 349 transitions. [2021-10-13 00:03:13,538 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 349 transitions. Word has length 21 [2021-10-13 00:03:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:13,539 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 349 transitions. [2021-10-13 00:03:13,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 349 transitions. [2021-10-13 00:03:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:13,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:13,542 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 00:03:13,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:03:13,542 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939810, now seen corresponding path program 10 times [2021-10-13 00:03:13,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:13,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138310990] [2021-10-13 00:03:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:13,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:14,567 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 00:03:14,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:14,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138310990] [2021-10-13 00:03:14,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138310990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:14,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:14,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:14,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69402736] [2021-10-13 00:03:14,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:14,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:14,571 INFO L87 Difference]: Start difference. First operand 171 states and 349 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:15,590 INFO L93 Difference]: Finished difference Result 200 states and 393 transitions. [2021-10-13 00:03:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:03:15,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:15,592 INFO L225 Difference]: With dead ends: 200 [2021-10-13 00:03:15,593 INFO L226 Difference]: Without dead ends: 200 [2021-10-13 00:03:15,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 936.9ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-13 00:03:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-10-13 00:03:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 1.9848484848484849) internal successors, (393), 199 states have internal predecessors, (393), 0 states have call successors, (0), 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 00:03:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 393 transitions. [2021-10-13 00:03:15,602 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 393 transitions. Word has length 21 [2021-10-13 00:03:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:15,602 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 393 transitions. [2021-10-13 00:03:15,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 393 transitions. [2021-10-13 00:03:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:15,604 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:15,604 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 00:03:15,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:03:15,605 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939781, now seen corresponding path program 4 times [2021-10-13 00:03:15,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:15,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143683093] [2021-10-13 00:03:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:15,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:15,944 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 00:03:15,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:15,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143683093] [2021-10-13 00:03:15,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143683093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:15,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:15,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:03:15,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023397295] [2021-10-13 00:03:15,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:03:15,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:15,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:03:15,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:15,946 INFO L87 Difference]: Start difference. First operand 200 states and 393 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:16,325 INFO L93 Difference]: Finished difference Result 277 states and 516 transitions. [2021-10-13 00:03:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:03:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:03:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:16,328 INFO L225 Difference]: With dead ends: 277 [2021-10-13 00:03:16,328 INFO L226 Difference]: Without dead ends: 247 [2021-10-13 00:03:16,329 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 261.3ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:03:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-13 00:03:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 188. [2021-10-13 00:03:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.043010752688172) internal successors, (380), 187 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 00:03:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 380 transitions. [2021-10-13 00:03:16,338 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 380 transitions. Word has length 21 [2021-10-13 00:03:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:16,338 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 380 transitions. [2021-10-13 00:03:16,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 380 transitions. [2021-10-13 00:03:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:16,339 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:16,339 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 00:03:16,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:03:16,340 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1955977246, now seen corresponding path program 11 times [2021-10-13 00:03:16,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:16,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698652422] [2021-10-13 00:03:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:16,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:17,307 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 00:03:17,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:17,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698652422] [2021-10-13 00:03:17,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698652422] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:17,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:17,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:17,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451707164] [2021-10-13 00:03:17,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:17,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:17,314 INFO L87 Difference]: Start difference. First operand 188 states and 380 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:18,370 INFO L93 Difference]: Finished difference Result 215 states and 421 transitions. [2021-10-13 00:03:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:03:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:18,373 INFO L225 Difference]: With dead ends: 215 [2021-10-13 00:03:18,373 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 00:03:18,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 915.6ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 00:03:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-10-13 00:03:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.0434782608695654) internal successors, (376), 185 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 00:03:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 376 transitions. [2021-10-13 00:03:18,386 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 376 transitions. Word has length 21 [2021-10-13 00:03:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:18,386 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 376 transitions. [2021-10-13 00:03:18,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 376 transitions. [2021-10-13 00:03:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:18,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:18,388 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 00:03:18,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:03:18,388 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1217238588, now seen corresponding path program 12 times [2021-10-13 00:03:18,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:18,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938690963] [2021-10-13 00:03:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:18,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:19,364 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 00:03:19,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:19,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938690963] [2021-10-13 00:03:19,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938690963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:19,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:19,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:19,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287786551] [2021-10-13 00:03:19,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:19,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:19,366 INFO L87 Difference]: Start difference. First operand 186 states and 376 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:20,635 INFO L93 Difference]: Finished difference Result 212 states and 416 transitions. [2021-10-13 00:03:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:20,638 INFO L225 Difference]: With dead ends: 212 [2021-10-13 00:03:20,638 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 00:03:20,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1041.0ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 00:03:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-10-13 00:03:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 2.0437158469945356) internal successors, (374), 184 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 00:03:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 374 transitions. [2021-10-13 00:03:20,646 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 374 transitions. Word has length 21 [2021-10-13 00:03:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:20,646 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 374 transitions. [2021-10-13 00:03:20,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 374 transitions. [2021-10-13 00:03:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:20,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:20,648 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 00:03:20,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:03:20,649 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -800839378, now seen corresponding path program 13 times [2021-10-13 00:03:20,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:20,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724775667] [2021-10-13 00:03:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:20,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:21,618 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 00:03:21,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:21,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724775667] [2021-10-13 00:03:21,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724775667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:21,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:21,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:21,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707087551] [2021-10-13 00:03:21,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:21,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:21,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:21,621 INFO L87 Difference]: Start difference. First operand 185 states and 374 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:22,636 INFO L93 Difference]: Finished difference Result 247 states and 473 transitions. [2021-10-13 00:03:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:22,637 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:22,639 INFO L225 Difference]: With dead ends: 247 [2021-10-13 00:03:22,640 INFO L226 Difference]: Without dead ends: 247 [2021-10-13 00:03:22,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 884.5ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-13 00:03:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 206. [2021-10-13 00:03:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 2.0) internal successors, (408), 205 states have internal predecessors, (408), 0 states have call successors, (0), 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 00:03:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 408 transitions. [2021-10-13 00:03:22,650 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 408 transitions. Word has length 21 [2021-10-13 00:03:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:22,651 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 408 transitions. [2021-10-13 00:03:22,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 408 transitions. [2021-10-13 00:03:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:22,652 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:22,652 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 00:03:22,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:03:22,653 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -800839407, now seen corresponding path program 5 times [2021-10-13 00:03:22,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:22,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763079964] [2021-10-13 00:03:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:22,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:23,013 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 00:03:23,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:23,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763079964] [2021-10-13 00:03:23,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763079964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:23,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:23,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:03:23,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402126726] [2021-10-13 00:03:23,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:03:23,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:03:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:23,015 INFO L87 Difference]: Start difference. First operand 206 states and 408 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:23,366 INFO L93 Difference]: Finished difference Result 296 states and 558 transitions. [2021-10-13 00:03:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:03:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:03:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:23,369 INFO L225 Difference]: With dead ends: 296 [2021-10-13 00:03:23,369 INFO L226 Difference]: Without dead ends: 283 [2021-10-13 00:03:23,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 230.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:03:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-10-13 00:03:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 201. [2021-10-13 00:03:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 199 states have (on average 2.050251256281407) internal successors, (408), 200 states have internal predecessors, (408), 0 states have call successors, (0), 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 00:03:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 408 transitions. [2021-10-13 00:03:23,383 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 408 transitions. Word has length 21 [2021-10-13 00:03:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:23,383 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 408 transitions. [2021-10-13 00:03:23,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 408 transitions. [2021-10-13 00:03:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:23,385 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:23,385 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 00:03:23,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:03:23,386 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash -626997040, now seen corresponding path program 14 times [2021-10-13 00:03:23,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:23,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356374498] [2021-10-13 00:03:23,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:23,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:24,425 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 00:03:24,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:24,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356374498] [2021-10-13 00:03:24,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356374498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:24,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:24,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:24,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674462111] [2021-10-13 00:03:24,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:24,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:24,428 INFO L87 Difference]: Start difference. First operand 201 states and 408 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:25,574 INFO L93 Difference]: Finished difference Result 240 states and 474 transitions. [2021-10-13 00:03:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:25,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:25,576 INFO L225 Difference]: With dead ends: 240 [2021-10-13 00:03:25,576 INFO L226 Difference]: Without dead ends: 225 [2021-10-13 00:03:25,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1001.2ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-10-13 00:03:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2021-10-13 00:03:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.050761421319797) internal successors, (404), 198 states have internal predecessors, (404), 0 states have call successors, (0), 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 00:03:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 404 transitions. [2021-10-13 00:03:25,585 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 404 transitions. Word has length 21 [2021-10-13 00:03:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:25,586 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 404 transitions. [2021-10-13 00:03:25,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 404 transitions. [2021-10-13 00:03:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:25,587 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:25,587 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 00:03:25,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:03:25,588 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -295988382, now seen corresponding path program 15 times [2021-10-13 00:03:25,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:25,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366589337] [2021-10-13 00:03:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:25,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:26,456 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 00:03:26,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:26,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366589337] [2021-10-13 00:03:26,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366589337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:26,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:26,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:26,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574900274] [2021-10-13 00:03:26,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:26,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:26,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:26,458 INFO L87 Difference]: Start difference. First operand 199 states and 404 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:27,396 INFO L93 Difference]: Finished difference Result 245 states and 478 transitions. [2021-10-13 00:03:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:03:27,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:27,398 INFO L225 Difference]: With dead ends: 245 [2021-10-13 00:03:27,398 INFO L226 Difference]: Without dead ends: 226 [2021-10-13 00:03:27,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 838.7ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-13 00:03:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-10-13 00:03:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 2.0046296296296298) internal successors, (433), 217 states have internal predecessors, (433), 0 states have call successors, (0), 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 00:03:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 433 transitions. [2021-10-13 00:03:27,408 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 433 transitions. Word has length 21 [2021-10-13 00:03:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:27,409 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 433 transitions. [2021-10-13 00:03:27,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 433 transitions. [2021-10-13 00:03:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:27,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:27,410 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 00:03:27,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:03:27,411 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 816483609, now seen corresponding path program 6 times [2021-10-13 00:03:27,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:27,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909329232] [2021-10-13 00:03:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:27,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:27,712 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 00:03:27,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:27,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909329232] [2021-10-13 00:03:27,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909329232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:27,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:27,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:03:27,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212933367] [2021-10-13 00:03:27,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:03:27,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:03:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:27,714 INFO L87 Difference]: Start difference. First operand 218 states and 433 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:27,951 INFO L93 Difference]: Finished difference Result 315 states and 586 transitions. [2021-10-13 00:03:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:03:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21 [2021-10-13 00:03:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:27,954 INFO L225 Difference]: With dead ends: 315 [2021-10-13 00:03:27,955 INFO L226 Difference]: Without dead ends: 292 [2021-10-13 00:03:27,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:03:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-10-13 00:03:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 187. [2021-10-13 00:03:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.0594594594594593) internal successors, (381), 186 states have internal predecessors, (381), 0 states have call successors, (0), 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 00:03:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 381 transitions. [2021-10-13 00:03:27,964 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 381 transitions. Word has length 21 [2021-10-13 00:03:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:27,965 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 381 transitions. [2021-10-13 00:03:27,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 00:03:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 381 transitions. [2021-10-13 00:03:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:27,966 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:27,966 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 00:03:27,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:03:27,967 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash -458357992, now seen corresponding path program 16 times [2021-10-13 00:03:27,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:27,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907545056] [2021-10-13 00:03:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:27,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:28,959 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 00:03:28,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:28,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907545056] [2021-10-13 00:03:28,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907545056] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:28,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:28,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:28,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370729968] [2021-10-13 00:03:28,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:28,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:28,962 INFO L87 Difference]: Start difference. First operand 187 states and 381 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:29,984 INFO L93 Difference]: Finished difference Result 212 states and 420 transitions. [2021-10-13 00:03:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:29,986 INFO L225 Difference]: With dead ends: 212 [2021-10-13 00:03:29,986 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 00:03:29,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1023.2ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 00:03:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-13 00:03:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 172 states have (on average 2.0988372093023258) internal successors, (361), 173 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 00:03:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 361 transitions. [2021-10-13 00:03:29,994 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 361 transitions. Word has length 21 [2021-10-13 00:03:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:29,995 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 361 transitions. [2021-10-13 00:03:29,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 361 transitions. [2021-10-13 00:03:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:29,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:29,996 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 00:03:29,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:03:29,997 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1747350066, now seen corresponding path program 17 times [2021-10-13 00:03:29,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:29,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964087629] [2021-10-13 00:03:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:29,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:30,152 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 00:03:30,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:30,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964087629] [2021-10-13 00:03:30,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964087629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:30,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:30,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:03:30,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172190494] [2021-10-13 00:03:30,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:03:30,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:03:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:03:30,155 INFO L87 Difference]: Start difference. First operand 174 states and 361 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:30,306 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2021-10-13 00:03:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:03:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 21 [2021-10-13 00:03:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:30,308 INFO L225 Difference]: With dead ends: 64 [2021-10-13 00:03:30,308 INFO L226 Difference]: Without dead ends: 64 [2021-10-13 00:03:30,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 129.4ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:03:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-13 00:03:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-13 00:03:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 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 00:03:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 105 transitions. [2021-10-13 00:03:30,311 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 105 transitions. Word has length 21 [2021-10-13 00:03:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:30,311 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 105 transitions. [2021-10-13 00:03:30,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 00:03:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2021-10-13 00:03:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:30,312 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:30,312 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 00:03:30,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:03:30,313 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1731723038, now seen corresponding path program 18 times [2021-10-13 00:03:30,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:30,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411234196] [2021-10-13 00:03:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:30,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:31,221 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 00:03:31,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:31,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411234196] [2021-10-13 00:03:31,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411234196] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:31,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:31,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:31,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496553843] [2021-10-13 00:03:31,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:31,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:31,223 INFO L87 Difference]: Start difference. First operand 64 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:32,071 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2021-10-13 00:03:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:03:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:32,072 INFO L225 Difference]: With dead ends: 91 [2021-10-13 00:03:32,072 INFO L226 Difference]: Without dead ends: 62 [2021-10-13 00:03:32,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 852.7ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-13 00:03:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-13 00:03:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 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 00:03:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2021-10-13 00:03:32,076 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 21 [2021-10-13 00:03:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:32,076 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2021-10-13 00:03:32,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2021-10-13 00:03:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:32,077 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:32,078 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 00:03:32,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:03:32,078 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1824505600, now seen corresponding path program 19 times [2021-10-13 00:03:32,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:32,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139273594] [2021-10-13 00:03:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:32,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:32,991 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 00:03:32,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:32,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139273594] [2021-10-13 00:03:32,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139273594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:32,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:32,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:32,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778505095] [2021-10-13 00:03:32,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:32,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:32,994 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:33,932 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2021-10-13 00:03:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:33,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:33,933 INFO L225 Difference]: With dead ends: 94 [2021-10-13 00:03:33,934 INFO L226 Difference]: Without dead ends: 67 [2021-10-13 00:03:33,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 888.4ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-13 00:03:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-10-13 00:03:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 63 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 00:03:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2021-10-13 00:03:33,937 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 21 [2021-10-13 00:03:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:33,938 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2021-10-13 00:03:33,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2021-10-13 00:03:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:33,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:33,939 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 00:03:33,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:03:33,940 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash -193572366, now seen corresponding path program 20 times [2021-10-13 00:03:33,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:33,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493747174] [2021-10-13 00:03:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:33,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:34,728 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 00:03:34,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:34,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493747174] [2021-10-13 00:03:34,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493747174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:34,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:34,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:34,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149178035] [2021-10-13 00:03:34,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:34,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:34,731 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:35,656 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2021-10-13 00:03:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:35,657 INFO L225 Difference]: With dead ends: 109 [2021-10-13 00:03:35,657 INFO L226 Difference]: Without dead ends: 96 [2021-10-13 00:03:35,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 785.2ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-13 00:03:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-10-13 00:03:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 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 00:03:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 122 transitions. [2021-10-13 00:03:35,661 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 122 transitions. Word has length 21 [2021-10-13 00:03:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:35,662 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 122 transitions. [2021-10-13 00:03:35,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 122 transitions. [2021-10-13 00:03:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:35,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:35,663 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 00:03:35,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:03:35,664 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash -19730028, now seen corresponding path program 21 times [2021-10-13 00:03:35,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:35,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674039838] [2021-10-13 00:03:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:35,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:36,448 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 00:03:36,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:36,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674039838] [2021-10-13 00:03:36,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674039838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:36,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:36,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:36,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285058520] [2021-10-13 00:03:36,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:36,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:36,449 INFO L87 Difference]: Start difference. First operand 74 states and 122 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:37,336 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-10-13 00:03:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:37,338 INFO L225 Difference]: With dead ends: 102 [2021-10-13 00:03:37,338 INFO L226 Difference]: Without dead ends: 87 [2021-10-13 00:03:37,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 779.4ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-13 00:03:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2021-10-13 00:03:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 71 states have internal predecessors, (118), 0 states have call successors, (0), 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 00:03:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2021-10-13 00:03:37,343 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 21 [2021-10-13 00:03:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:37,343 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-10-13 00:03:37,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2021-10-13 00:03:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:37,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:37,344 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 00:03:37,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:03:37,345 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash 311278630, now seen corresponding path program 22 times [2021-10-13 00:03:37,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:37,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268778993] [2021-10-13 00:03:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:37,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:38,182 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 00:03:38,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:38,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268778993] [2021-10-13 00:03:38,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268778993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:38,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:38,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:38,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552879120] [2021-10-13 00:03:38,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:38,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:38,185 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:39,091 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-10-13 00:03:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 00:03:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:39,093 INFO L225 Difference]: With dead ends: 102 [2021-10-13 00:03:39,093 INFO L226 Difference]: Without dead ends: 77 [2021-10-13 00:03:39,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 841.0ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-10-13 00:03:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-13 00:03:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2021-10-13 00:03:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 67 states have internal predecessors, (110), 0 states have call successors, (0), 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 00:03:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2021-10-13 00:03:39,099 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 21 [2021-10-13 00:03:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:39,099 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2021-10-13 00:03:39,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2021-10-13 00:03:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:39,100 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:39,100 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 00:03:39,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:03:39,101 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 148909020, now seen corresponding path program 23 times [2021-10-13 00:03:39,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:39,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322145693] [2021-10-13 00:03:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:39,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:39,870 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 00:03:39,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:39,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322145693] [2021-10-13 00:03:39,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322145693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:39,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:39,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:39,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380592840] [2021-10-13 00:03:39,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:39,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:39,872 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:40,847 INFO L93 Difference]: Finished difference Result 94 states and 150 transitions. [2021-10-13 00:03:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:03:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:40,848 INFO L225 Difference]: With dead ends: 94 [2021-10-13 00:03:40,849 INFO L226 Difference]: Without dead ends: 58 [2021-10-13 00:03:40,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 853.2ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-10-13 00:03:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-10-13 00:03:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 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 00:03:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2021-10-13 00:03:40,852 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 21 [2021-10-13 00:03:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:40,852 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2021-10-13 00:03:40,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2021-10-13 00:03:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:40,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:40,853 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 00:03:40,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 00:03:40,854 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -574776384, now seen corresponding path program 24 times [2021-10-13 00:03:40,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:40,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400569456] [2021-10-13 00:03:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:40,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:41,644 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 00:03:41,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:41,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400569456] [2021-10-13 00:03:41,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400569456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:41,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:41,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:41,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721918127] [2021-10-13 00:03:41,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:41,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:41,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:41,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:41,647 INFO L87 Difference]: Start difference. First operand 58 states and 93 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:42,713 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2021-10-13 00:03:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:42,714 INFO L225 Difference]: With dead ends: 84 [2021-10-13 00:03:42,714 INFO L226 Difference]: Without dead ends: 57 [2021-10-13 00:03:42,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 939.4ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-13 00:03:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-10-13 00:03:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.625) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 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 00:03:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2021-10-13 00:03:42,716 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 21 [2021-10-13 00:03:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:42,716 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2021-10-13 00:03:42,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2021-10-13 00:03:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:42,717 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:42,717 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 00:03:42,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:03:42,717 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1702112946, now seen corresponding path program 25 times [2021-10-13 00:03:42,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:42,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356244503] [2021-10-13 00:03:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:42,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:43,535 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 00:03:43,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:43,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356244503] [2021-10-13 00:03:43,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356244503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:43,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:43,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:43,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69755106] [2021-10-13 00:03:43,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:43,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:43,536 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:44,489 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2021-10-13 00:03:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-13 00:03:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:44,491 INFO L225 Difference]: With dead ends: 102 [2021-10-13 00:03:44,491 INFO L226 Difference]: Without dead ends: 89 [2021-10-13 00:03:44,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 896.4ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-10-13 00:03:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-10-13 00:03:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 66 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 00:03:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 109 transitions. [2021-10-13 00:03:44,495 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 109 transitions. Word has length 21 [2021-10-13 00:03:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:44,495 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 109 transitions. [2021-10-13 00:03:44,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 109 transitions. [2021-10-13 00:03:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:44,496 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:44,496 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 00:03:44,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 00:03:44,497 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1875955284, now seen corresponding path program 26 times [2021-10-13 00:03:44,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:44,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436864449] [2021-10-13 00:03:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:44,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:45,301 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 00:03:45,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:45,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436864449] [2021-10-13 00:03:45,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436864449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:45,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:45,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:45,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526375242] [2021-10-13 00:03:45,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:45,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:45,304 INFO L87 Difference]: Start difference. First operand 67 states and 109 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:46,232 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-10-13 00:03:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:46,234 INFO L225 Difference]: With dead ends: 95 [2021-10-13 00:03:46,234 INFO L226 Difference]: Without dead ends: 80 [2021-10-13 00:03:46,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 871.3ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-13 00:03:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-10-13 00:03:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.640625) internal successors, (105), 64 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 00:03:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2021-10-13 00:03:46,237 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 21 [2021-10-13 00:03:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:46,237 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2021-10-13 00:03:46,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2021-10-13 00:03:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:46,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:46,239 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 00:03:46,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 00:03:46,239 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2088003354, now seen corresponding path program 27 times [2021-10-13 00:03:46,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:46,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789313536] [2021-10-13 00:03:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:46,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:47,091 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 00:03:47,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:47,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789313536] [2021-10-13 00:03:47,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789313536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:47,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:47,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:47,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793705657] [2021-10-13 00:03:47,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:47,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:47,094 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:48,070 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-10-13 00:03:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:48,071 INFO L225 Difference]: With dead ends: 95 [2021-10-13 00:03:48,071 INFO L226 Difference]: Without dead ends: 70 [2021-10-13 00:03:48,072 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 922.5ms TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-13 00:03:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-10-13 00:03:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 60 states have internal predecessors, (97), 0 states have call successors, (0), 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 00:03:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 97 transitions. [2021-10-13 00:03:48,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 97 transitions. Word has length 21 [2021-10-13 00:03:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:48,075 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 97 transitions. [2021-10-13 00:03:48,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 97 transitions. [2021-10-13 00:03:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:48,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:48,076 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 00:03:48,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 00:03:48,077 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2044594332, now seen corresponding path program 28 times [2021-10-13 00:03:48,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:48,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826452012] [2021-10-13 00:03:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:48,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:48,921 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 00:03:48,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:48,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826452012] [2021-10-13 00:03:48,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826452012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:48,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:48,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:48,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472467868] [2021-10-13 00:03:48,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:48,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:48,924 INFO L87 Difference]: Start difference. First operand 61 states and 97 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:49,912 INFO L93 Difference]: Finished difference Result 87 states and 137 transitions. [2021-10-13 00:03:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:49,913 INFO L225 Difference]: With dead ends: 87 [2021-10-13 00:03:49,913 INFO L226 Difference]: Without dead ends: 55 [2021-10-13 00:03:49,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 976.1ms TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-13 00:03:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-10-13 00:03:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 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 00:03:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 87 transitions. [2021-10-13 00:03:49,917 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 87 transitions. Word has length 21 [2021-10-13 00:03:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:49,917 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 87 transitions. [2021-10-13 00:03:49,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 87 transitions. [2021-10-13 00:03:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:49,918 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:49,918 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 00:03:49,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 00:03:49,919 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1975039054, now seen corresponding path program 29 times [2021-10-13 00:03:49,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:49,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259321689] [2021-10-13 00:03:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:49,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:50,690 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 00:03:50,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:50,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259321689] [2021-10-13 00:03:50,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259321689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:50,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:50,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:50,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953814320] [2021-10-13 00:03:50,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:50,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:50,693 INFO L87 Difference]: Start difference. First operand 55 states and 87 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:51,625 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2021-10-13 00:03:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-13 00:03:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:51,627 INFO L225 Difference]: With dead ends: 102 [2021-10-13 00:03:51,627 INFO L226 Difference]: Without dead ends: 89 [2021-10-13 00:03:51,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 879.7ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-10-13 00:03:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-10-13 00:03:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 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 00:03:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 108 transitions. [2021-10-13 00:03:51,630 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 108 transitions. Word has length 21 [2021-10-13 00:03:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:51,630 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 108 transitions. [2021-10-13 00:03:51,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 108 transitions. [2021-10-13 00:03:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:51,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:51,631 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 00:03:51,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 00:03:51,631 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1801196716, now seen corresponding path program 30 times [2021-10-13 00:03:51,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:51,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515123111] [2021-10-13 00:03:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:51,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:52,428 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 00:03:52,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:52,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515123111] [2021-10-13 00:03:52,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515123111] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:52,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:52,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:52,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424269264] [2021-10-13 00:03:52,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:52,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:52,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:52,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:52,429 INFO L87 Difference]: Start difference. First operand 67 states and 108 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:53,350 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-10-13 00:03:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:53,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:53,352 INFO L225 Difference]: With dead ends: 95 [2021-10-13 00:03:53,352 INFO L226 Difference]: Without dead ends: 80 [2021-10-13 00:03:53,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 914.5ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-13 00:03:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-10-13 00:03:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.625) internal successors, (104), 64 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 00:03:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2021-10-13 00:03:53,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 21 [2021-10-13 00:03:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:53,355 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2021-10-13 00:03:53,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2021-10-13 00:03:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:53,356 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:53,356 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 00:03:53,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 00:03:53,357 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1470188058, now seen corresponding path program 31 times [2021-10-13 00:03:53,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:53,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522867392] [2021-10-13 00:03:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:53,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:54,081 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 00:03:54,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:54,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522867392] [2021-10-13 00:03:54,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522867392] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:54,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:54,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:54,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207645009] [2021-10-13 00:03:54,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:54,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:54,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:54,083 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:55,051 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-10-13 00:03:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:03:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:55,052 INFO L225 Difference]: With dead ends: 95 [2021-10-13 00:03:55,052 INFO L226 Difference]: Without dead ends: 70 [2021-10-13 00:03:55,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 872.2ms TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:03:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-13 00:03:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-10-13 00:03:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 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 00:03:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2021-10-13 00:03:55,055 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 21 [2021-10-13 00:03:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:55,056 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2021-10-13 00:03:55,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2021-10-13 00:03:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:55,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:55,057 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 00:03:55,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 00:03:55,057 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1632557668, now seen corresponding path program 32 times [2021-10-13 00:03:55,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:55,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815165972] [2021-10-13 00:03:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:55,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:55,783 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 00:03:55,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:55,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815165972] [2021-10-13 00:03:55,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815165972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:55,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:55,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:55,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474017820] [2021-10-13 00:03:55,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:55,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:55,785 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:56,827 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2021-10-13 00:03:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:56,828 INFO L225 Difference]: With dead ends: 87 [2021-10-13 00:03:56,828 INFO L226 Difference]: Without dead ends: 51 [2021-10-13 00:03:56,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 961.2ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-13 00:03:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-10-13 00:03:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 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 00:03:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2021-10-13 00:03:56,831 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2021-10-13 00:03:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:56,832 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2021-10-13 00:03:56,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2021-10-13 00:03:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:56,833 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:56,833 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 00:03:56,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 00:03:56,833 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1707326496, now seen corresponding path program 33 times [2021-10-13 00:03:56,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:56,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494001419] [2021-10-13 00:03:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:56,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:57,665 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 00:03:57,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:57,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494001419] [2021-10-13 00:03:57,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494001419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:57,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:57,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:57,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844197584] [2021-10-13 00:03:57,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:57,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:57,669 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:03:58,507 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2021-10-13 00:03:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 00:03:58,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:03:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:03:58,508 INFO L225 Difference]: With dead ends: 69 [2021-10-13 00:03:58,508 INFO L226 Difference]: Without dead ends: 56 [2021-10-13 00:03:58,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 897.5ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:03:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-13 00:03:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2021-10-13 00:03:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 46 states have internal predecessors, (71), 0 states have call successors, (0), 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 00:03:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2021-10-13 00:03:58,510 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 21 [2021-10-13 00:03:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:03:58,511 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2021-10-13 00:03:58,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:03:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2021-10-13 00:03:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:03:58,512 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:03:58,512 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 00:03:58,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 00:03:58,512 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:03:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:03:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1533484158, now seen corresponding path program 34 times [2021-10-13 00:03:58,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:03:58,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279150939] [2021-10-13 00:03:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:03:58,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:03:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:03:59,315 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 00:03:59,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:03:59,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279150939] [2021-10-13 00:03:59,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279150939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:03:59,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:03:59,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:03:59,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508556209] [2021-10-13 00:03:59,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:03:59,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:03:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:03:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:03:59,317 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:04:00,196 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2021-10-13 00:04:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:04:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:04:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:04:00,197 INFO L225 Difference]: With dead ends: 64 [2021-10-13 00:04:00,197 INFO L226 Difference]: Without dead ends: 49 [2021-10-13 00:04:00,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 904.7ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:04:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-10-13 00:04:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-10-13 00:04:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 44 states have internal predecessors, (67), 0 states have call successors, (0), 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 00:04:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2021-10-13 00:04:00,199 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 21 [2021-10-13 00:04:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:04:00,199 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2021-10-13 00:04:00,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2021-10-13 00:04:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:04:00,199 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:04:00,200 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 00:04:00,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-13 00:04:00,200 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:04:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:04:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1202475500, now seen corresponding path program 35 times [2021-10-13 00:04:00,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:04:00,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247347589] [2021-10-13 00:04:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:04:00,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:04:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:04:01,148 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 00:04:01,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:04:01,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247347589] [2021-10-13 00:04:01,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247347589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:04:01,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:04:01,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:04:01,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881574654] [2021-10-13 00:04:01,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:04:01,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:04:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:04:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:04:01,150 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:04:02,316 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2021-10-13 00:04:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:04:02,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:04:02,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:04:02,318 INFO L225 Difference]: With dead ends: 66 [2021-10-13 00:04:02,318 INFO L226 Difference]: Without dead ends: 41 [2021-10-13 00:04:02,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1173.3ms TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-10-13 00:04:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-10-13 00:04:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-10-13 00:04:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.475) internal successors, (59), 40 states have internal predecessors, (59), 0 states have call successors, (0), 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 00:04:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2021-10-13 00:04:02,321 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 21 [2021-10-13 00:04:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:04:02,321 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2021-10-13 00:04:02,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2021-10-13 00:04:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:04:02,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:04:02,322 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 00:04:02,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 00:04:02,323 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:04:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:04:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1364845110, now seen corresponding path program 36 times [2021-10-13 00:04:02,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:04:02,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132679061] [2021-10-13 00:04:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:04:02,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:04:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:04:03,167 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 00:04:03,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:04:03,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132679061] [2021-10-13 00:04:03,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132679061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:04:03,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:04:03,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 00:04:03,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480791893] [2021-10-13 00:04:03,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 00:04:03,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:04:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 00:04:03,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:04:03,169 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:04:04,064 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-10-13 00:04:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 00:04:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 21 [2021-10-13 00:04:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:04:04,064 INFO L225 Difference]: With dead ends: 40 [2021-10-13 00:04:04,065 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:04:04,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 991.5ms TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:04:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:04:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:04:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 00:04:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:04:04,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-10-13 00:04:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:04:04,066 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:04:04,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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 00:04:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:04:04,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:04:04,068 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:04:04,069 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 00:04:04,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 00:04:04,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-13 00:04:04,074 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 00:04:04,074 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:04:04,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:04:04 BasicIcfg [2021-10-13 00:04:04,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:04:04,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:04:04,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:04:04,077 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:04:04,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:01" (3/4) ... [2021-10-13 00:04:04,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:04:04,090 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-10-13 00:04:04,097 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-13 00:04:04,097 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 00:04:04,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:04:04,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:04:04,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:04:04,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:04:04,158 INFO L168 Benchmark]: Toolchain (without parser) took 124724.11 ms. Allocated memory was 111.1 MB in the beginning and 243.3 MB in the end (delta: 132.1 MB). Free memory was 79.2 MB in the beginning and 86.2 MB in the end (delta: -6.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,158 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 111.1 MB. Free memory is still 64.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:04:04,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1204.69 ms. Allocated memory was 111.1 MB in the beginning and 138.4 MB in the end (delta: 27.3 MB). Free memory was 79.2 MB in the beginning and 66.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.49 ms. Allocated memory is still 138.4 MB. Free memory was 66.3 MB in the beginning and 63.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,161 INFO L168 Benchmark]: Boogie Preprocessor took 74.60 ms. Allocated memory is still 138.4 MB. Free memory was 63.1 MB in the beginning and 111.5 MB in the end (delta: -48.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,162 INFO L168 Benchmark]: RCFGBuilder took 629.14 ms. Allocated memory is still 138.4 MB. Free memory was 111.5 MB in the beginning and 92.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,162 INFO L168 Benchmark]: TraceAbstraction took 122615.16 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 91.5 MB in the beginning and 90.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 104.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,163 INFO L168 Benchmark]: Witness Printer took 78.61 ms. Allocated memory is still 243.3 MB. Free memory was 90.4 MB in the beginning and 86.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:04:04,166 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.24 ms. Allocated memory is still 111.1 MB. Free memory is still 64.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1204.69 ms. Allocated memory was 111.1 MB in the beginning and 138.4 MB in the end (delta: 27.3 MB). Free memory was 79.2 MB in the beginning and 66.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 115.49 ms. Allocated memory is still 138.4 MB. Free memory was 66.3 MB in the beginning and 63.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.60 ms. Allocated memory is still 138.4 MB. Free memory was 63.1 MB in the beginning and 111.5 MB in the end (delta: -48.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 629.14 ms. Allocated memory is still 138.4 MB. Free memory was 111.5 MB in the beginning and 92.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 122615.16 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 91.5 MB in the beginning and 90.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 104.7 MB. Max. memory is 16.1 GB. * Witness Printer took 78.61 ms. Allocated memory is still 243.3 MB. Free memory was 90.4 MB in the beginning and 86.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47292.3ms, 167 PlacesBefore, 39 PlacesAfterwards, 169 TransitionsBefore, 35 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 8 FixpointIterations, 97 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 191 TotalNumberOfCompositions, 6296 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3552, positive: 3324, positive conditional: 0, positive unconditional: 3324, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2250, positive: 2187, positive conditional: 0, positive unconditional: 2187, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2250, positive: 2182, positive conditional: 0, positive unconditional: 2182, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27356, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 324, negative conditional: 0, negative unconditional: 324, unknown: 26999, unknown conditional: 0, unknown unconditional: 26999] ], Cache Queries: [ total: 3552, positive: 1137, positive conditional: 0, positive unconditional: 1137, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 2250, unknown conditional: 0, unknown unconditional: 2250] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - 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 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 178 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 122440.2ms, OverallIterations: 46, TraceHistogramMax: 1, EmptinessCheckTime: 64.5ms, AutomataDifference: 39970.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 47386.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 913 SDtfs, 2221 SDslu, 3721 SDs, 0 SdLazy, 13222 SolverSat, 1276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15683.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 958 GetRequests, 53 SyntacticMatches, 73 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 34661.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=3, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 395.3ms AutomataMinimizationTime, 46 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 152.0ms SsaConstructionTime, 1767.7ms SatisfiabilityAnalysisTime, 31559.8ms InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 21662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-13 00:04:04,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f389a62-b59e-4cd3-9306-7cd45f929e43/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...