./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.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_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/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_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/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_48306656-7119-4577-9846-8e66ec013518/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 dd263d20067137356e96cf6640993a49b235f8dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40:52,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:40:52,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:40:52,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:40:52,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:40:52,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:40:52,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:40:52,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:40:52,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:40:52,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:40:52,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:40:52,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:40:52,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:40:52,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:40:52,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:40:52,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:40:52,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:40:52,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:40:52,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:40:52,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:40:52,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:40:52,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:40:52,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:40:52,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:40:52,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:40:52,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:40:52,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:40:52,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:40:52,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:40:52,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:40:52,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:40:52,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:40:52,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:40:52,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:40:52,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:40:52,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:40:52,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:40:52,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:40:52,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:40:52,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:40:52,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:40:52,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:40:52,474 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:40:52,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:40:52,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:40:52,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:40:52,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:40:52,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:40:52,492 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:40:52,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:40:52,493 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:40:52,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:40:52,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:40:52,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:40:52,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:40:52,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:40:52,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:40:52,496 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:40:52,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:40:52,497 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:40:52,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:40:52,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:40:52,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:40:52,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:40:52,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:40:52,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:40:52,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:40:52,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:40:52,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:40:52,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:40:52,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:40:52,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:40:52,503 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_48306656-7119-4577-9846-8e66ec013518/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_48306656-7119-4577-9846-8e66ec013518/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 -> dd263d20067137356e96cf6640993a49b235f8dc [2021-10-13 00:40:52,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:40:52,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:40:52,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:40:52,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:40:52,903 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:40:52,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2021-10-13 00:40:52,992 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/data/934f3fee9/e72bc339ecb34a708b31196c352251a7/FLAG720902d04 [2021-10-13 00:40:53,886 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:40:53,887 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2021-10-13 00:40:53,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/data/934f3fee9/e72bc339ecb34a708b31196c352251a7/FLAG720902d04 [2021-10-13 00:40:54,000 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/data/934f3fee9/e72bc339ecb34a708b31196c352251a7 [2021-10-13 00:40:54,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:40:54,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:40:54,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:40:54,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:40:54,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:40:54,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:40:54" (1/1) ... [2021-10-13 00:40:54,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4240aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:54, skipping insertion in model container [2021-10-13 00:40:54,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:40:54" (1/1) ... [2021-10-13 00:40:54,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:40:54,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:40:55,103 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_48306656-7119-4577-9846-8e66ec013518/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2021-10-13 00:40:55,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:40:55,162 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:40:55,226 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_48306656-7119-4577-9846-8e66ec013518/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2021-10-13 00:40:55,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:40:55,431 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:40:55,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55 WrapperNode [2021-10-13 00:40:55,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:40:55,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:40:55,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:40:55,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:40:55,444 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:40:55" (1/1) ... [2021-10-13 00:40:55,481 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:40:55" (1/1) ... [2021-10-13 00:40:55,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:40:55,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:40:55,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:40:55,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:40:55,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:40:55,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:40:55,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:40:55,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:40:55,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (1/1) ... [2021-10-13 00:40:55,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:40:55,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:40:55,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:40:55,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:40:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:40:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:40:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-13 00:40:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:40:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:40:55,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:40:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-10-13 00:40:55,695 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-10-13 00:40:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:40:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:40:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:40:55,698 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:40:56,586 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:40:56,586 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-10-13 00:40:56,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:40:56 BoogieIcfgContainer [2021-10-13 00:40:56,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:40:56,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:40:56,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:40:56,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:40:56,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:40:54" (1/3) ... [2021-10-13 00:40:56,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f873c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:40:56, skipping insertion in model container [2021-10-13 00:40:56,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:40:55" (2/3) ... [2021-10-13 00:40:56,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f873c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:40:56, skipping insertion in model container [2021-10-13 00:40:56,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:40:56" (3/3) ... [2021-10-13 00:40:56,605 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2021-10-13 00:40:56,612 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 00:40:56,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:40:56,612 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-10-13 00:40:56,612 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 00:40:56,655 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,655 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,656 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,656 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,661 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,662 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,662 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,662 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,664 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,664 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,665 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,665 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,665 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,665 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,666 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,666 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,666 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,666 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,667 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,667 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,667 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,667 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,667 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,668 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,668 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,668 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,685 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,685 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,685 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,685 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,686 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,686 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,688 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,688 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,688 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,688 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,688 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,689 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,714 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,715 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,715 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,716 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,716 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,716 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,717 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,717 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,718 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,718 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,719 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,719 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,720 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,720 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,721 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,721 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,721 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,722 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,722 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,722 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,723 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,723 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,727 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,727 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,727 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,727 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,728 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,728 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,730 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,730 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,736 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,737 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,737 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,737 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,738 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,738 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,739 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:40:56,753 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-13 00:40:56,816 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:40:56,824 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:40:56,825 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-10-13 00:40:56,847 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 00:40:56,862 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 168 transitions, 352 flow [2021-10-13 00:40:56,865 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 168 transitions, 352 flow [2021-10-13 00:40:56,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 168 transitions, 352 flow [2021-10-13 00:40:56,977 INFO L129 PetriNetUnfolder]: 10/204 cut-off events. [2021-10-13 00:40:56,980 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 00:40:56,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 10/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-10-13 00:40:56,996 INFO L116 LiptonReduction]: Number of co-enabled transitions 2756 [2021-10-13 00:42:00,111 INFO L131 LiptonReduction]: Checked pairs total: 6754 [2021-10-13 00:42:00,112 INFO L133 LiptonReduction]: Total number of compositions: 192 [2021-10-13 00:42:00,151 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 37 transitions, 90 flow [2021-10-13 00:42:00,195 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:42:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:42:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-13 00:42:00,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:00,205 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-13 00:42:00,206 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2021-10-13 00:42:00,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:00,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323233345] [2021-10-13 00:42:00,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:00,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:00,465 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:42:00,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:00,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323233345] [2021-10-13 00:42:00,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323233345] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:00,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:00,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-13 00:42:00,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812411298] [2021-10-13 00:42:00,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 00:42:00,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:00,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 00:42:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 00:42:00,517 INFO L87 Difference]: Start difference. First operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 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:42:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:00,553 INFO L93 Difference]: Finished difference Result 403 states and 993 transitions. [2021-10-13 00:42:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 00:42:00,554 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:42:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:00,570 INFO L225 Difference]: With dead ends: 403 [2021-10-13 00:42:00,570 INFO L226 Difference]: Without dead ends: 366 [2021-10-13 00:42:00,571 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:42:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-13 00:42:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-13 00:42:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 2.488888888888889) internal successors, (896), 365 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:42:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 896 transitions. [2021-10-13 00:42:00,645 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 896 transitions. Word has length 1 [2021-10-13 00:42:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:00,646 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 896 transitions. [2021-10-13 00:42:00,646 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:42:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 896 transitions. [2021-10-13 00:42:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 00:42:00,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:00,647 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 00:42:00,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:42:00,648 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:42:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:00,649 INFO L82 PathProgramCache]: Analyzing trace with hash 18732823, now seen corresponding path program 1 times [2021-10-13 00:42:00,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:00,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699337219] [2021-10-13 00:42:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:00,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:00,980 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:42:00,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:00,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699337219] [2021-10-13 00:42:00,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699337219] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:00,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:00,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:42:00,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328695903] [2021-10-13 00:42:00,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:42:00,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:42:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:42:00,986 INFO L87 Difference]: Start difference. First operand 366 states and 896 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have 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:42:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:01,109 INFO L93 Difference]: Finished difference Result 521 states and 1271 transitions. [2021-10-13 00:42:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:42:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-13 00:42:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:01,119 INFO L225 Difference]: With dead ends: 521 [2021-10-13 00:42:01,119 INFO L226 Difference]: Without dead ends: 521 [2021-10-13 00:42:01,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:42:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-10-13 00:42:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 425. [2021-10-13 00:42:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 2.5023809523809524) internal successors, (1051), 424 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have 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:42:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1051 transitions. [2021-10-13 00:42:01,182 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1051 transitions. Word has length 4 [2021-10-13 00:42:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:01,182 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1051 transitions. [2021-10-13 00:42:01,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have 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:42:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1051 transitions. [2021-10-13 00:42:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 00:42:01,184 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:01,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 00:42:01,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:42:01,185 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:42:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 822387402, now seen corresponding path program 1 times [2021-10-13 00:42:01,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:01,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386172549] [2021-10-13 00:42:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:01,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:01,303 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:42:01,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:01,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386172549] [2021-10-13 00:42:01,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386172549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:01,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:01,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:42:01,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341258328] [2021-10-13 00:42:01,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:42:01,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:42:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:42:01,307 INFO L87 Difference]: Start difference. First operand 425 states and 1051 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:42:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:01,441 INFO L93 Difference]: Finished difference Result 580 states and 1394 transitions. [2021-10-13 00:42:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:42:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-13 00:42:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:01,447 INFO L225 Difference]: With dead ends: 580 [2021-10-13 00:42:01,447 INFO L226 Difference]: Without dead ends: 495 [2021-10-13 00:42:01,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:42:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-10-13 00:42:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 463. [2021-10-13 00:42:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 459 states have (on average 2.52723311546841) internal successors, (1160), 462 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have 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:42:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1160 transitions. [2021-10-13 00:42:01,472 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1160 transitions. Word has length 6 [2021-10-13 00:42:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:01,472 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 1160 transitions. [2021-10-13 00:42:01,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:42:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1160 transitions. [2021-10-13 00:42:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:42:01,475 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:01,475 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:42:01,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:42:01,476 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash -732185907, now seen corresponding path program 1 times [2021-10-13 00:42:01,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:01,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623985336] [2021-10-13 00:42:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:01,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:01,577 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:42:01,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:01,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623985336] [2021-10-13 00:42:01,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623985336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:01,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:01,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:42:01,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742909885] [2021-10-13 00:42:01,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:42:01,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:01,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:42:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:42:01,580 INFO L87 Difference]: Start difference. First operand 463 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:01,595 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2021-10-13 00:42:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:42:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 00:42:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:01,598 INFO L225 Difference]: With dead ends: 143 [2021-10-13 00:42:01,598 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 00:42:01,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:42:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 00:42:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-10-13 00:42:01,604 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:42:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2021-10-13 00:42:01,605 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 10 [2021-10-13 00:42:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:01,605 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2021-10-13 00:42:01,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2021-10-13 00:42:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:01,608 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:01,608 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:42:01,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:42:01,609 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1281610976, now seen corresponding path program 1 times [2021-10-13 00:42:01,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:01,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086201771] [2021-10-13 00:42:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:01,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:02,113 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:42:02,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:02,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086201771] [2021-10-13 00:42:02,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086201771] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:02,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:02,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:42:02,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884944498] [2021-10-13 00:42:02,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:42:02,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:42:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:42:02,116 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:02,378 INFO L93 Difference]: Finished difference Result 228 states and 452 transitions. [2021-10-13 00:42:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:42:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:02,381 INFO L225 Difference]: With dead ends: 228 [2021-10-13 00:42:02,381 INFO L226 Difference]: Without dead ends: 228 [2021-10-13 00:42:02,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 140.0ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:42:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-13 00:42:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 173. [2021-10-13 00:42:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 2.1169590643274856) internal successors, (362), 172 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have 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:42:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 362 transitions. [2021-10-13 00:42:02,392 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 362 transitions. Word has length 21 [2021-10-13 00:42:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:02,395 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 362 transitions. [2021-10-13 00:42:02,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 362 transitions. [2021-10-13 00:42:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:02,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:02,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:42:02,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:42:02,411 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1281610992, now seen corresponding path program 1 times [2021-10-13 00:42:02,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:02,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78689279] [2021-10-13 00:42:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:02,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:02,703 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:42:02,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:02,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78689279] [2021-10-13 00:42:02,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78689279] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:02,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:02,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:42:02,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636350768] [2021-10-13 00:42:02,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:42:02,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:42:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:42:02,706 INFO L87 Difference]: Start difference. First operand 173 states and 362 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:02,751 INFO L93 Difference]: Finished difference Result 185 states and 370 transitions. [2021-10-13 00:42:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:42:02,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:42:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:02,753 INFO L225 Difference]: With dead ends: 185 [2021-10-13 00:42:02,754 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 00:42:02,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:42:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 00:42:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2021-10-13 00:42:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 2.046783625730994) internal successors, (350), 172 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:42:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 350 transitions. [2021-10-13 00:42:02,761 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 350 transitions. Word has length 21 [2021-10-13 00:42:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:02,761 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 350 transitions. [2021-10-13 00:42:02,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 350 transitions. [2021-10-13 00:42:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:02,763 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:02,763 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:42:02,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:42:02,763 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash 102222796, now seen corresponding path program 2 times [2021-10-13 00:42:02,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:02,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229448307] [2021-10-13 00:42:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:02,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:03,264 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:42:03,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:03,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229448307] [2021-10-13 00:42:03,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229448307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:03,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:03,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:42:03,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046006538] [2021-10-13 00:42:03,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:42:03,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:42:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:42:03,267 INFO L87 Difference]: Start difference. First operand 173 states and 350 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:03,586 INFO L93 Difference]: Finished difference Result 231 states and 445 transitions. [2021-10-13 00:42:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:42:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:03,589 INFO L225 Difference]: With dead ends: 231 [2021-10-13 00:42:03,589 INFO L226 Difference]: Without dead ends: 231 [2021-10-13 00:42:03,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 217.9ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:42:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-13 00:42:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 164. [2021-10-13 00:42:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.0555555555555554) internal successors, (333), 163 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:42:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 333 transitions. [2021-10-13 00:42:03,597 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 333 transitions. Word has length 21 [2021-10-13 00:42:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:03,598 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 333 transitions. [2021-10-13 00:42:03,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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:42:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 333 transitions. [2021-10-13 00:42:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:03,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:03,599 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:42:03,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:42:03,600 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 102222812, now seen corresponding path program 2 times [2021-10-13 00:42:03,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:03,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477168795] [2021-10-13 00:42:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:03,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:04,485 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:42:04,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:04,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477168795] [2021-10-13 00:42:04,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477168795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:04,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:04,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:04,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474560392] [2021-10-13 00:42:04,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:04,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:04,489 INFO L87 Difference]: Start difference. First operand 164 states and 333 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:05,430 INFO L93 Difference]: Finished difference Result 238 states and 453 transitions. [2021-10-13 00:42:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:42:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:05,433 INFO L225 Difference]: With dead ends: 238 [2021-10-13 00:42:05,434 INFO L226 Difference]: Without dead ends: 209 [2021-10-13 00:42:05,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 575.8ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-13 00:42:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 164. [2021-10-13 00:42:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.04320987654321) internal successors, (331), 163 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have 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:42:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2021-10-13 00:42:05,442 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 21 [2021-10-13 00:42:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:05,443 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2021-10-13 00:42:05,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2021-10-13 00:42:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:05,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:05,444 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:42:05,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:42:05,445 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash -204109654, now seen corresponding path program 3 times [2021-10-13 00:42:05,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:05,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826389461] [2021-10-13 00:42:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:05,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:06,231 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:42:06,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:06,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826389461] [2021-10-13 00:42:06,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826389461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:06,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:06,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:06,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159764685] [2021-10-13 00:42:06,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:06,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:06,234 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:07,307 INFO L93 Difference]: Finished difference Result 285 states and 550 transitions. [2021-10-13 00:42:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:42:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:07,317 INFO L225 Difference]: With dead ends: 285 [2021-10-13 00:42:07,317 INFO L226 Difference]: Without dead ends: 259 [2021-10-13 00:42:07,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 579.0ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-13 00:42:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2021-10-13 00:42:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 2.0238095238095237) internal successors, (340), 169 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 340 transitions. [2021-10-13 00:42:07,325 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 340 transitions. Word has length 21 [2021-10-13 00:42:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:07,326 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 340 transitions. [2021-10-13 00:42:07,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 340 transitions. [2021-10-13 00:42:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:07,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:07,327 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:42:07,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:42:07,328 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:42:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:07,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1412997104, now seen corresponding path program 4 times [2021-10-13 00:42:07,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:07,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137802405] [2021-10-13 00:42:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:07,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:08,085 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:42:08,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:08,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137802405] [2021-10-13 00:42:08,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137802405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:08,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:08,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:08,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121719281] [2021-10-13 00:42:08,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:08,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:08,088 INFO L87 Difference]: Start difference. First operand 170 states and 340 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:08,961 INFO L93 Difference]: Finished difference Result 275 states and 536 transitions. [2021-10-13 00:42:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:42:08,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:08,964 INFO L225 Difference]: With dead ends: 275 [2021-10-13 00:42:08,964 INFO L226 Difference]: Without dead ends: 254 [2021-10-13 00:42:08,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 556.4ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-13 00:42:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 191. [2021-10-13 00:42:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 1.9735449735449735) internal successors, (373), 190 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:42:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 373 transitions. [2021-10-13 00:42:08,973 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 373 transitions. Word has length 21 [2021-10-13 00:42:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:08,974 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 373 transitions. [2021-10-13 00:42:08,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 373 transitions. [2021-10-13 00:42:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:08,975 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:08,975 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:42:08,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:42:08,975 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 438603950, now seen corresponding path program 3 times [2021-10-13 00:42:08,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:08,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733318628] [2021-10-13 00:42:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:08,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:09,513 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:42:09,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:09,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733318628] [2021-10-13 00:42:09,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733318628] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:09,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:09,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:09,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713679268] [2021-10-13 00:42:09,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:09,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:09,515 INFO L87 Difference]: Start difference. First operand 191 states and 373 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:10,493 INFO L93 Difference]: Finished difference Result 296 states and 540 transitions. [2021-10-13 00:42:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:42:10,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:10,495 INFO L225 Difference]: With dead ends: 296 [2021-10-13 00:42:10,495 INFO L226 Difference]: Without dead ends: 279 [2021-10-13 00:42:10,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 584.7ms TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-13 00:42:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-13 00:42:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2021-10-13 00:42:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.9894736842105263) internal successors, (378), 191 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 378 transitions. [2021-10-13 00:42:10,504 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 378 transitions. Word has length 21 [2021-10-13 00:42:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:10,504 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 378 transitions. [2021-10-13 00:42:10,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 378 transitions. [2021-10-13 00:42:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:10,505 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:10,506 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:42:10,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:42:10,506 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:42:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1508287920, now seen corresponding path program 5 times [2021-10-13 00:42:10,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:10,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515137302] [2021-10-13 00:42:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:10,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:11,130 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:42:11,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:11,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515137302] [2021-10-13 00:42:11,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515137302] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:11,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:11,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:11,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775502584] [2021-10-13 00:42:11,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:11,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:11,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:11,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:11,134 INFO L87 Difference]: Start difference. First operand 192 states and 378 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:12,041 INFO L93 Difference]: Finished difference Result 278 states and 542 transitions. [2021-10-13 00:42:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:42:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:12,044 INFO L225 Difference]: With dead ends: 278 [2021-10-13 00:42:12,044 INFO L226 Difference]: Without dead ends: 265 [2021-10-13 00:42:12,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 532.2ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-13 00:42:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 194. [2021-10-13 00:42:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.984375) internal successors, (381), 193 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:42:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 381 transitions. [2021-10-13 00:42:12,051 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 381 transitions. Word has length 21 [2021-10-13 00:42:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:12,052 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 381 transitions. [2021-10-13 00:42:12,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 381 transitions. [2021-10-13 00:42:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:12,053 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:12,053 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:42:12,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:42:12,054 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:42:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -264690400, now seen corresponding path program 6 times [2021-10-13 00:42:12,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:12,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150588924] [2021-10-13 00:42:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:12,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:12,716 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:42:12,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:12,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150588924] [2021-10-13 00:42:12,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150588924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:12,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:12,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:12,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654587669] [2021-10-13 00:42:12,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:12,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:12,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:12,718 INFO L87 Difference]: Start difference. First operand 194 states and 381 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:13,660 INFO L93 Difference]: Finished difference Result 287 states and 552 transitions. [2021-10-13 00:42:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:42:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:13,663 INFO L225 Difference]: With dead ends: 287 [2021-10-13 00:42:13,663 INFO L226 Difference]: Without dead ends: 262 [2021-10-13 00:42:13,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 543.6ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-13 00:42:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 182. [2021-10-13 00:42:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.0) internal successors, (360), 181 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have 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:42:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 360 transitions. [2021-10-13 00:42:13,671 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 360 transitions. Word has length 21 [2021-10-13 00:42:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:13,671 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 360 transitions. [2021-10-13 00:42:13,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 360 transitions. [2021-10-13 00:42:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:13,673 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:13,673 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:42:13,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:42:13,673 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:42:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1192952198, now seen corresponding path program 7 times [2021-10-13 00:42:13,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:13,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700326421] [2021-10-13 00:42:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:13,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:14,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:42:14,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:14,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700326421] [2021-10-13 00:42:14,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700326421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:14,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:14,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:14,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447638963] [2021-10-13 00:42:14,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:14,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:14,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:14,393 INFO L87 Difference]: Start difference. First operand 182 states and 360 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:15,138 INFO L93 Difference]: Finished difference Result 256 states and 488 transitions. [2021-10-13 00:42:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:42:15,139 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:15,141 INFO L225 Difference]: With dead ends: 256 [2021-10-13 00:42:15,141 INFO L226 Difference]: Without dead ends: 220 [2021-10-13 00:42:15,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 516.4ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:42:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-13 00:42:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2021-10-13 00:42:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.9941520467836258) internal successors, (341), 172 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have 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:42:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 341 transitions. [2021-10-13 00:42:15,149 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 341 transitions. Word has length 21 [2021-10-13 00:42:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:15,149 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 341 transitions. [2021-10-13 00:42:15,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 341 transitions. [2021-10-13 00:42:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:15,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:15,151 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:42:15,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:42:15,151 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:42:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1333887598, now seen corresponding path program 8 times [2021-10-13 00:42:15,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:15,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433271367] [2021-10-13 00:42:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:15,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:15,295 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:42:15,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:15,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433271367] [2021-10-13 00:42:15,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433271367] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:15,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:15,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:42:15,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577801107] [2021-10-13 00:42:15,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:42:15,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:42:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:42:15,301 INFO L87 Difference]: Start difference. First operand 173 states and 341 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:15,337 INFO L93 Difference]: Finished difference Result 99 states and 149 transitions. [2021-10-13 00:42:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:42:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:42:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:15,339 INFO L225 Difference]: With dead ends: 99 [2021-10-13 00:42:15,339 INFO L226 Difference]: Without dead ends: 99 [2021-10-13 00:42:15,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:42:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-10-13 00:42:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-10-13 00:42:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 98 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have 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:42:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 149 transitions. [2021-10-13 00:42:15,343 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 149 transitions. Word has length 21 [2021-10-13 00:42:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:15,343 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 149 transitions. [2021-10-13 00:42:15,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 149 transitions. [2021-10-13 00:42:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:15,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:15,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:42:15,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:42:15,345 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash 52663296, now seen corresponding path program 4 times [2021-10-13 00:42:15,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:15,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116766744] [2021-10-13 00:42:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:15,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:15,873 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:42:15,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:15,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116766744] [2021-10-13 00:42:15,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116766744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:15,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:15,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:15,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663081321] [2021-10-13 00:42:15,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:15,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:15,876 INFO L87 Difference]: Start difference. First operand 99 states and 149 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:16,411 INFO L93 Difference]: Finished difference Result 161 states and 231 transitions. [2021-10-13 00:42:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:42:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:16,413 INFO L225 Difference]: With dead ends: 161 [2021-10-13 00:42:16,413 INFO L226 Difference]: Without dead ends: 161 [2021-10-13 00:42:16,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 427.3ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-13 00:42:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-10-13 00:42:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 100. [2021-10-13 00:42:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.530612244897959) internal successors, (150), 99 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:42:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2021-10-13 00:42:16,419 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 21 [2021-10-13 00:42:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:16,420 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2021-10-13 00:42:16,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2021-10-13 00:42:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:16,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:16,421 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:42:16,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:42:16,422 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:42:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 52663312, now seen corresponding path program 9 times [2021-10-13 00:42:16,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:16,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46622705] [2021-10-13 00:42:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:16,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:17,093 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:42:17,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:17,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46622705] [2021-10-13 00:42:17,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46622705] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:17,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:17,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:17,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877145581] [2021-10-13 00:42:17,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:17,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:17,096 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:17,665 INFO L93 Difference]: Finished difference Result 112 states and 161 transitions. [2021-10-13 00:42:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:17,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:17,666 INFO L225 Difference]: With dead ends: 112 [2021-10-13 00:42:17,666 INFO L226 Difference]: Without dead ends: 98 [2021-10-13 00:42:17,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 456.9ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-13 00:42:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-10-13 00:42:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 97 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:42:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2021-10-13 00:42:17,678 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 21 [2021-10-13 00:42:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:17,679 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2021-10-13 00:42:17,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2021-10-13 00:42:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:17,680 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:17,680 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:42:17,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:42:17,681 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1114879470, now seen corresponding path program 10 times [2021-10-13 00:42:17,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:17,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829001117] [2021-10-13 00:42:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:17,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:18,318 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:42:18,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:18,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829001117] [2021-10-13 00:42:18,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829001117] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:18,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:18,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:18,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490757443] [2021-10-13 00:42:18,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:18,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:18,321 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:18,974 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2021-10-13 00:42:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:18,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:18,975 INFO L225 Difference]: With dead ends: 109 [2021-10-13 00:42:18,975 INFO L226 Difference]: Without dead ends: 97 [2021-10-13 00:42:18,975 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 591.3ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-13 00:42:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-10-13 00:42:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 96 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:42:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2021-10-13 00:42:18,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 21 [2021-10-13 00:42:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:18,980 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2021-10-13 00:42:18,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2021-10-13 00:42:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:18,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:18,981 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:42:18,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:42:18,982 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:42:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash -289146760, now seen corresponding path program 11 times [2021-10-13 00:42:18,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:18,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486962212] [2021-10-13 00:42:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:18,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:19,714 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:42:19,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:19,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486962212] [2021-10-13 00:42:19,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486962212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:19,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:19,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:19,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400596955] [2021-10-13 00:42:19,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:19,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:19,716 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:20,434 INFO L93 Difference]: Finished difference Result 106 states and 152 transitions. [2021-10-13 00:42:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:20,436 INFO L225 Difference]: With dead ends: 106 [2021-10-13 00:42:20,436 INFO L226 Difference]: Without dead ends: 95 [2021-10-13 00:42:20,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 592.6ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-10-13 00:42:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-10-13 00:42:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.5053763440860215) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:42:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2021-10-13 00:42:20,439 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 21 [2021-10-13 00:42:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:20,439 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2021-10-13 00:42:20,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2021-10-13 00:42:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:20,440 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:20,440 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:42:20,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:42:20,440 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:42:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2138704750, now seen corresponding path program 12 times [2021-10-13 00:42:20,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:20,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865891446] [2021-10-13 00:42:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:20,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:21,077 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:42:21,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:21,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865891446] [2021-10-13 00:42:21,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865891446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:21,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:21,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:21,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689837657] [2021-10-13 00:42:21,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:21,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:21,080 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:21,791 INFO L93 Difference]: Finished difference Result 102 states and 146 transitions. [2021-10-13 00:42:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:21,793 INFO L225 Difference]: With dead ends: 102 [2021-10-13 00:42:21,793 INFO L226 Difference]: Without dead ends: 93 [2021-10-13 00:42:21,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 595.2ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-13 00:42:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-10-13 00:42:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have 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:42:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2021-10-13 00:42:21,797 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 21 [2021-10-13 00:42:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:21,797 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2021-10-13 00:42:21,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2021-10-13 00:42:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:21,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:21,798 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:42:21,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:42:21,799 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:42:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1318907652, now seen corresponding path program 13 times [2021-10-13 00:42:21,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:21,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643805246] [2021-10-13 00:42:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:21,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:22,475 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:42:22,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:22,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643805246] [2021-10-13 00:42:22,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643805246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:22,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:22,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:22,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735890908] [2021-10-13 00:42:22,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:22,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:22,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:22,477 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:23,066 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2021-10-13 00:42:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:23,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:23,067 INFO L225 Difference]: With dead ends: 103 [2021-10-13 00:42:23,067 INFO L226 Difference]: Without dead ends: 93 [2021-10-13 00:42:23,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 493.6ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-13 00:42:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-10-13 00:42:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2021-10-13 00:42:23,070 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 21 [2021-10-13 00:42:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:23,071 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2021-10-13 00:42:23,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2021-10-13 00:42:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:23,072 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:23,072 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:42:23,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:42:23,072 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash 76486452, now seen corresponding path program 14 times [2021-10-13 00:42:23,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:23,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175677007] [2021-10-13 00:42:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:23,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:23,705 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:42:23,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:23,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175677007] [2021-10-13 00:42:23,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175677007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:23,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:23,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:23,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417095529] [2021-10-13 00:42:23,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:23,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:23,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:23,707 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:24,448 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2021-10-13 00:42:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:24,449 INFO L225 Difference]: With dead ends: 96 [2021-10-13 00:42:24,449 INFO L226 Difference]: Without dead ends: 73 [2021-10-13 00:42:24,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 610.2ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-13 00:42:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-10-13 00:42:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2021-10-13 00:42:24,452 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 21 [2021-10-13 00:42:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:24,452 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-10-13 00:42:24,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2021-10-13 00:42:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:24,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:24,453 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:42:24,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:42:24,453 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:42:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1915863174, now seen corresponding path program 15 times [2021-10-13 00:42:24,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:24,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218459517] [2021-10-13 00:42:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:24,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:25,135 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:42:25,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:25,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218459517] [2021-10-13 00:42:25,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218459517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:25,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:25,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:25,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621894737] [2021-10-13 00:42:25,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:25,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:25,139 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:25,675 INFO L93 Difference]: Finished difference Result 99 states and 143 transitions. [2021-10-13 00:42:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:25,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:25,676 INFO L225 Difference]: With dead ends: 99 [2021-10-13 00:42:25,676 INFO L226 Difference]: Without dead ends: 70 [2021-10-13 00:42:25,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 485.7ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-13 00:42:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-10-13 00:42:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have 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:42:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2021-10-13 00:42:25,679 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 21 [2021-10-13 00:42:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:25,679 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2021-10-13 00:42:25,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2021-10-13 00:42:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:25,680 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:25,680 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:42:25,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:42:25,680 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2017699296, now seen corresponding path program 5 times [2021-10-13 00:42:25,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:25,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006444827] [2021-10-13 00:42:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:25,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:26,111 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:42:26,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:26,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006444827] [2021-10-13 00:42:26,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006444827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:26,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:26,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:26,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098506356] [2021-10-13 00:42:26,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:26,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:26,113 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:26,453 INFO L93 Difference]: Finished difference Result 90 states and 131 transitions. [2021-10-13 00:42:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:42:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:26,454 INFO L225 Difference]: With dead ends: 90 [2021-10-13 00:42:26,454 INFO L226 Difference]: Without dead ends: 90 [2021-10-13 00:42:26,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 304.7ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-13 00:42:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2021-10-13 00:42:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 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:42:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2021-10-13 00:42:26,458 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 21 [2021-10-13 00:42:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:26,459 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2021-10-13 00:42:26,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2021-10-13 00:42:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:26,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:26,460 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:42:26,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:42:26,460 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 00:42:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2017699280, now seen corresponding path program 16 times [2021-10-13 00:42:26,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:26,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502636994] [2021-10-13 00:42:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:26,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:27,066 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:42:27,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:27,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502636994] [2021-10-13 00:42:27,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502636994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:27,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:27,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 00:42:27,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669810913] [2021-10-13 00:42:27,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:42:27,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:42:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:42:27,068 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:27,673 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2021-10-13 00:42:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:27,674 INFO L225 Difference]: With dead ends: 69 [2021-10-13 00:42:27,674 INFO L226 Difference]: Without dead ends: 51 [2021-10-13 00:42:27,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 556.2ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-13 00:42:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-13 00:42:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-10-13 00:42:27,676 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:42:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2021-10-13 00:42:27,677 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2021-10-13 00:42:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:27,677 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2021-10-13 00:42:27,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2021-10-13 00:42:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:27,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:27,678 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:42:27,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:42:27,678 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:42:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -501470342, now seen corresponding path program 17 times [2021-10-13 00:42:27,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:27,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917147424] [2021-10-13 00:42:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:27,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:28,289 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:42:28,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:28,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917147424] [2021-10-13 00:42:28,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917147424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:28,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:28,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:28,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248655760] [2021-10-13 00:42:28,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:28,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:28,291 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:28,684 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2021-10-13 00:42:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:28,686 INFO L225 Difference]: With dead ends: 72 [2021-10-13 00:42:28,686 INFO L226 Difference]: Without dead ends: 46 [2021-10-13 00:42:28,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 360.1ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-10-13 00:42:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-10-13 00:42:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 45 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:42:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2021-10-13 00:42:28,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 21 [2021-10-13 00:42:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:28,688 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2021-10-13 00:42:28,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2021-10-13 00:42:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:28,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:28,689 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:42:28,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:42:28,689 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:42:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1115636416, now seen corresponding path program 18 times [2021-10-13 00:42:28,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:28,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862699235] [2021-10-13 00:42:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:28,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:29,230 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:42:29,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:29,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862699235] [2021-10-13 00:42:29,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862699235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:29,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:29,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:29,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058303718] [2021-10-13 00:42:29,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:29,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:29,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:29,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:29,232 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:29,734 INFO L93 Difference]: Finished difference Result 59 states and 87 transitions. [2021-10-13 00:42:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:29,735 INFO L225 Difference]: With dead ends: 59 [2021-10-13 00:42:29,735 INFO L226 Difference]: Without dead ends: 38 [2021-10-13 00:42:29,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 421.5ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-13 00:42:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-13 00:42:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:42:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2021-10-13 00:42:29,737 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 21 [2021-10-13 00:42:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:29,737 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2021-10-13 00:42:29,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2021-10-13 00:42:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:29,738 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:29,738 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:42:29,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:42:29,738 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:42:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1210927232, now seen corresponding path program 19 times [2021-10-13 00:42:29,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:29,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415287941] [2021-10-13 00:42:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:29,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:30,246 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:42:30,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:30,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415287941] [2021-10-13 00:42:30,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415287941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:30,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:30,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:30,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832461914] [2021-10-13 00:42:30,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:30,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:30,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:30,248 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:30,607 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-10-13 00:42:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:30,607 INFO L225 Difference]: With dead ends: 47 [2021-10-13 00:42:30,608 INFO L226 Difference]: Without dead ends: 34 [2021-10-13 00:42:30,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 346.5ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-13 00:42:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-10-13 00:42:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:42:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-10-13 00:42:30,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2021-10-13 00:42:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:30,610 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-10-13 00:42:30,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2021-10-13 00:42:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:42:30,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:42:30,611 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:42:30,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:42:30,611 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:42:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:42:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -562051088, now seen corresponding path program 20 times [2021-10-13 00:42:30,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:42:30,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169270072] [2021-10-13 00:42:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:42:30,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:42:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:42:31,129 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:42:31,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:42:31,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169270072] [2021-10-13 00:42:31,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169270072] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:42:31,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:42:31,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:42:31,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109792354] [2021-10-13 00:42:31,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 00:42:31,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:42:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:42:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:42:31,130 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:42:31,481 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-10-13 00:42:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:42:31,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:42:31,482 INFO L225 Difference]: With dead ends: 33 [2021-10-13 00:42:31,482 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:42:31,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 344.6ms TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-10-13 00:42:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:42:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:42:31,483 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:42:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:42:31,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-10-13 00:42:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:42:31,483 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:42:31,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:42:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:42:31,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:42:31,486 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,486 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,487 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,492 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,492 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,492 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:42:31,504 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 00:42:31,504 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 00:42:31,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:42:31,508 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 00:42:31,508 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:42:31,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:42:31 BasicIcfg [2021-10-13 00:42:31,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:42:31,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:42:31,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:42:31,512 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:42:31,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:40:56" (3/4) ... [2021-10-13 00:42:31,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:42:31,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-10-13 00:42:31,527 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-13 00:42:31,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 00:42:31,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:42:31,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:42:31,567 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:42:31,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:42:31,568 INFO L168 Benchmark]: Toolchain (without parser) took 97560.63 ms. Allocated memory was 107.0 MB in the beginning and 222.3 MB in the end (delta: 115.3 MB). Free memory was 69.8 MB in the beginning and 135.6 MB in the end (delta: -65.7 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,569 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 79.7 MB. Free memory was 57.7 MB in the beginning and 57.7 MB in the end (delta: 27.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:42:31,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1419.34 ms. Allocated memory is still 107.0 MB. Free memory was 69.8 MB in the beginning and 77.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.69 ms. Allocated memory is still 107.0 MB. Free memory was 77.8 MB in the beginning and 74.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,570 INFO L168 Benchmark]: Boogie Preprocessor took 55.44 ms. Allocated memory is still 107.0 MB. Free memory was 74.7 MB in the beginning and 72.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,571 INFO L168 Benchmark]: RCFGBuilder took 1011.44 ms. Allocated memory is still 107.0 MB. Free memory was 72.0 MB in the beginning and 52.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,571 INFO L168 Benchmark]: TraceAbstraction took 94919.05 ms. Allocated memory was 107.0 MB in the beginning and 222.3 MB in the end (delta: 115.3 MB). Free memory was 52.1 MB in the beginning and 139.8 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:42:31,571 INFO L168 Benchmark]: Witness Printer took 55.97 ms. Allocated memory is still 222.3 MB. Free memory was 139.8 MB in the beginning and 135.6 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:42:31,574 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.31 ms. Allocated memory is still 79.7 MB. Free memory was 57.7 MB in the beginning and 57.7 MB in the end (delta: 27.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1419.34 ms. Allocated memory is still 107.0 MB. Free memory was 69.8 MB in the beginning and 77.8 MB in the end (delta: -8.0 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.69 ms. Allocated memory is still 107.0 MB. Free memory was 77.8 MB in the beginning and 74.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.44 ms. Allocated memory is still 107.0 MB. Free memory was 74.7 MB in the beginning and 72.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1011.44 ms. Allocated memory is still 107.0 MB. Free memory was 72.0 MB in the beginning and 52.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 94919.05 ms. Allocated memory was 107.0 MB in the beginning and 222.3 MB in the end (delta: 115.3 MB). Free memory was 52.1 MB in the beginning and 139.8 MB in the end (delta: -87.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. * Witness Printer took 55.97 ms. Allocated memory is still 222.3 MB. Free memory was 139.8 MB in the beginning and 135.6 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: 63246.5ms, 166 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 37 TransitionsAfterwards, 2756 CoEnabledTransitionPairs, 9 FixpointIterations, 104 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 192 TotalNumberOfCompositions, 6754 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3397, positive: 3139, positive conditional: 0, positive unconditional: 3139, negative: 258, negative conditional: 0, negative unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2062, positive: 2001, positive conditional: 0, positive unconditional: 2001, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2062, positive: 1994, positive conditional: 0, positive unconditional: 1994, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41635, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 327, negative conditional: 0, negative unconditional: 327, unknown: 41258, unknown conditional: 0, unknown unconditional: 41258] ], Cache Queries: [ total: 3397, positive: 1138, positive conditional: 0, positive unconditional: 1138, negative: 197, negative conditional: 0, negative unconditional: 197, unknown: 2062, unknown conditional: 0, unknown unconditional: 2062] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - 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, 176 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 94693.7ms, OverallIterations: 29, TraceHistogramMax: 1, EmptinessCheckTime: 45.4ms, AutomataDifference: 15180.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 63369.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 621 SDtfs, 958 SDslu, 1971 SDs, 0 SdLazy, 5973 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7992.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 37 SyntacticMatches, 42 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 10897.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=3, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 277.1ms AutomataMinimizationTime, 29 MinimizatonAttempts, 833 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 111.7ms SsaConstructionTime, 1414.1ms SatisfiabilityAnalysisTime, 13525.6ms InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 11677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:42:31,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48306656-7119-4577-9846-8e66ec013518/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...