./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_2-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_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/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_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/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_2aea0e96-2d4f-4161-973b-9f8849565fff/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 f642aa2c8450a6773cb633057d1c74c446cbd236 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:00:14,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:00:14,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:00:14,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:00:14,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:00:14,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:00:14,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:00:14,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:00:14,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:00:14,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:00:14,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:00:14,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:00:14,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:00:14,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:00:14,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:00:14,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:00:14,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:00:14,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:00:14,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:00:14,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:00:14,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:00:14,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:00:14,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:00:14,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:00:14,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:00:14,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:00:14,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:00:14,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:00:14,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:00:14,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:00:14,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:00:14,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:00:14,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:00:14,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:00:14,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:00:14,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:00:14,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:00:14,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:00:14,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:00:14,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:00:14,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:00:14,114 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:00:14,156 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:00:14,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:00:14,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:00:14,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:00:14,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:00:14,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:00:14,167 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:00:14,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:00:14,167 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:00:14,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:00:14,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:00:14,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:00:14,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:00:14,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:00:14,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:00:14,170 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:00:14,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:00:14,170 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:00:14,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:00:14,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:00:14,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:00:14,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:00:14,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:00:14,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:00:14,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:00:14,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:00:14,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:00:14,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:00:14,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:00:14,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:00:14,173 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_2aea0e96-2d4f-4161-973b-9f8849565fff/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_2aea0e96-2d4f-4161-973b-9f8849565fff/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 -> f642aa2c8450a6773cb633057d1c74c446cbd236 [2021-10-13 01:00:14,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:00:14,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:00:14,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:00:14,487 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:00:14,488 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:00:14,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2021-10-13 01:00:14,553 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/data/c523f50c3/9527599ac1bf4fe4a382b57455abdb2d/FLAG53067ff30 [2021-10-13 01:00:15,230 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:00:15,231 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2021-10-13 01:00:15,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/data/c523f50c3/9527599ac1bf4fe4a382b57455abdb2d/FLAG53067ff30 [2021-10-13 01:00:15,416 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/data/c523f50c3/9527599ac1bf4fe4a382b57455abdb2d [2021-10-13 01:00:15,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:00:15,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:00:15,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:00:15,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:00:15,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:00:15,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:00:15" (1/1) ... [2021-10-13 01:00:15,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c467a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:15, skipping insertion in model container [2021-10-13 01:00:15,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:00:15" (1/1) ... [2021-10-13 01:00:15,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:00:15,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:00:15,713 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-10-13 01:00:16,199 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_2aea0e96-2d4f-4161-973b-9f8849565fff/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-10-13 01:00:16,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:00:16,241 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:00:16,253 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-10-13 01:00:16,281 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_2aea0e96-2d4f-4161-973b-9f8849565fff/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-10-13 01:00:16,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:00:16,444 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:00:16,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16 WrapperNode [2021-10-13 01:00:16,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:00:16,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:00:16,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:00:16,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:00:16,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:00:16,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:00:16,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:00:16,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:00:16,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:00:16,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:00:16,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:00:16,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:00:16,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (1/1) ... [2021-10-13 01:00:16,575 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:00:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:00:16,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:00:16,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:00:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 01:00:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 01:00:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 01:00:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 01:00:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 01:00:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:00:16,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:00:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-10-13 01:00:16,649 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-10-13 01:00:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:00:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 01:00:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:00:16,652 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 01:00:17,330 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:00:17,331 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-10-13 01:00:17,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:00:17 BoogieIcfgContainer [2021-10-13 01:00:17,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:00:17,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:00:17,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:00:17,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:00:17,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:00:15" (1/3) ... [2021-10-13 01:00:17,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3b117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:00:17, skipping insertion in model container [2021-10-13 01:00:17,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:00:16" (2/3) ... [2021-10-13 01:00:17,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff3b117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:00:17, skipping insertion in model container [2021-10-13 01:00:17,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:00:17" (3/3) ... [2021-10-13 01:00:17,341 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-10-13 01:00:17,346 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 01:00:17,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:00:17,346 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-10-13 01:00:17,346 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 01:00:17,381 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,381 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,382 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,382 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,382 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,382 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,388 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,389 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,389 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,389 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,389 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,389 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,390 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,390 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,390 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,390 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,391 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,391 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,391 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,391 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,392 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,392 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,392 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,392 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,392 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,393 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,393 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,393 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,393 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,398 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,398 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,399 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,399 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,404 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,405 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,405 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,405 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,406 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,406 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,409 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,409 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,410 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,410 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,410 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,410 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,410 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,411 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,411 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,411 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:00:17,418 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-13 01:00:17,462 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:00:17,468 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:00:17,468 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-10-13 01:00:17,484 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 01:00:17,494 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 160 transitions, 336 flow [2021-10-13 01:00:17,497 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 160 transitions, 336 flow [2021-10-13 01:00:17,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 336 flow [2021-10-13 01:00:17,586 INFO L129 PetriNetUnfolder]: 10/196 cut-off events. [2021-10-13 01:00:17,586 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 01:00:17,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 10/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 299 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2021-10-13 01:00:17,598 INFO L116 LiptonReduction]: Number of co-enabled transitions 1836 [2021-10-13 01:01:16,281 INFO L131 LiptonReduction]: Checked pairs total: 3822 [2021-10-13 01:01:16,282 INFO L133 LiptonReduction]: Total number of compositions: 198 [2021-10-13 01:01:16,302 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions, 78 flow [2021-10-13 01:01:16,334 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-13 01:01:16,342 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:16,342 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-13 01:01:16,343 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 01:01:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2021-10-13 01:01:16,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:16,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978315865] [2021-10-13 01:01:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:16,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:16,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:16,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978315865] [2021-10-13 01:01:16,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978315865] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:16,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:16,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-13 01:01:16,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572002363] [2021-10-13 01:01:16,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 01:01:16,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 01:01:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 01:01:16,650 INFO L87 Difference]: Start difference. First operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 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 01:01:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:16,678 INFO L93 Difference]: Finished difference Result 176 states and 392 transitions. [2021-10-13 01:01:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 01:01:16,679 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 01:01:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:16,695 INFO L225 Difference]: With dead ends: 176 [2021-10-13 01:01:16,695 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 01:01:16,697 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 01:01:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 01:01:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-10-13 01:01:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 153 states have (on average 2.2941176470588234) internal successors, (351), 158 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2021-10-13 01:01:16,768 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 1 [2021-10-13 01:01:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:16,769 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2021-10-13 01:01:16,769 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 01:01:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2021-10-13 01:01:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 01:01:16,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:16,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 01:01:16,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:01:16,771 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 01:01:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash 576323437, now seen corresponding path program 1 times [2021-10-13 01:01:16,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:16,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639691418] [2021-10-13 01:01:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:16,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:17,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:17,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639691418] [2021-10-13 01:01:17,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639691418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:17,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:17,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:01:17,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130507976] [2021-10-13 01:01:17,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:01:17,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:01:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:01:17,016 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:17,172 INFO L93 Difference]: Finished difference Result 232 states and 517 transitions. [2021-10-13 01:01:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:01:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-13 01:01:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:17,176 INFO L225 Difference]: With dead ends: 232 [2021-10-13 01:01:17,176 INFO L226 Difference]: Without dead ends: 232 [2021-10-13 01:01:17,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:01:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-13 01:01:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2021-10-13 01:01:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 2.3248730964467006) internal successors, (458), 201 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 458 transitions. [2021-10-13 01:01:17,192 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 458 transitions. Word has length 5 [2021-10-13 01:01:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:17,193 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 458 transitions. [2021-10-13 01:01:17,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 458 transitions. [2021-10-13 01:01:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 01:01:17,194 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:17,194 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 01:01:17,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:01:17,194 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 01:01:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 576323474, now seen corresponding path program 1 times [2021-10-13 01:01:17,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:17,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575021054] [2021-10-13 01:01:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:17,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:17,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 01:01:17,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:17,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575021054] [2021-10-13 01:01:17,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575021054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:17,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:17,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 01:01:17,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018680273] [2021-10-13 01:01:17,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:01:17,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:01:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:17,267 INFO L87 Difference]: Start difference. First operand 202 states and 458 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:17,339 INFO L93 Difference]: Finished difference Result 260 states and 572 transitions. [2021-10-13 01:01:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:01:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-13 01:01:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:17,343 INFO L225 Difference]: With dead ends: 260 [2021-10-13 01:01:17,343 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 01:01:17,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:01:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 01:01:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2021-10-13 01:01:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 234 states have (on average 2.3162393162393164) internal successors, (542), 237 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 542 transitions. [2021-10-13 01:01:17,359 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 542 transitions. Word has length 5 [2021-10-13 01:01:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:17,359 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 542 transitions. [2021-10-13 01:01:17,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 542 transitions. [2021-10-13 01:01:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:01:17,362 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:17,362 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:17,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:01:17,362 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 01:01:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash 510614164, now seen corresponding path program 1 times [2021-10-13 01:01:17,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:17,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750181802] [2021-10-13 01:01:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:17,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:17,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:17,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750181802] [2021-10-13 01:01:17,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750181802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:17,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:17,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:01:17,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818418849] [2021-10-13 01:01:17,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:01:17,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:01:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:17,430 INFO L87 Difference]: Start difference. First operand 238 states and 542 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:17,445 INFO L93 Difference]: Finished difference Result 73 states and 144 transitions. [2021-10-13 01:01:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:01:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 01:01:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:17,446 INFO L225 Difference]: With dead ends: 73 [2021-10-13 01:01:17,446 INFO L226 Difference]: Without dead ends: 73 [2021-10-13 01:01:17,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:01:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-13 01:01:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-10-13 01:01:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 2.028169014084507) internal successors, (144), 72 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 01:01:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 144 transitions. [2021-10-13 01:01:17,451 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 144 transitions. Word has length 10 [2021-10-13 01:01:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:17,451 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 144 transitions. [2021-10-13 01:01:17,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 144 transitions. [2021-10-13 01:01:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:17,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:17,453 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:17,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:01:17,453 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 01:01:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash -92004590, now seen corresponding path program 1 times [2021-10-13 01:01:17,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:17,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333475892] [2021-10-13 01:01:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:17,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:18,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:18,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333475892] [2021-10-13 01:01:18,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333475892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:18,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:18,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:01:18,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37226567] [2021-10-13 01:01:18,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:01:18,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:01:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:01:18,278 INFO L87 Difference]: Start difference. First operand 73 states and 144 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:19,020 INFO L93 Difference]: Finished difference Result 120 states and 207 transitions. [2021-10-13 01:01:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:01:19,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:19,021 INFO L225 Difference]: With dead ends: 120 [2021-10-13 01:01:19,022 INFO L226 Difference]: Without dead ends: 120 [2021-10-13 01:01:19,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 493.5ms TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:01:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-13 01:01:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2021-10-13 01:01:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.9318181818181819) internal successors, (170), 89 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 170 transitions. [2021-10-13 01:01:19,026 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 170 transitions. Word has length 17 [2021-10-13 01:01:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:19,027 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 170 transitions. [2021-10-13 01:01:19,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 170 transitions. [2021-10-13 01:01:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:19,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:19,028 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:19,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:01:19,029 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 01:01:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -92004612, now seen corresponding path program 1 times [2021-10-13 01:01:19,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:19,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373924315] [2021-10-13 01:01:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:19,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:19,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:19,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373924315] [2021-10-13 01:01:19,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373924315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:19,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:19,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:01:19,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852368616] [2021-10-13 01:01:19,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:01:19,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:01:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:01:19,487 INFO L87 Difference]: Start difference. First operand 90 states and 170 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:19,880 INFO L93 Difference]: Finished difference Result 151 states and 262 transitions. [2021-10-13 01:01:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:01:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:19,882 INFO L225 Difference]: With dead ends: 151 [2021-10-13 01:01:19,882 INFO L226 Difference]: Without dead ends: 134 [2021-10-13 01:01:19,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 306.5ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:01:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-10-13 01:01:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2021-10-13 01:01:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.892156862745098) internal successors, (193), 103 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 193 transitions. [2021-10-13 01:01:19,905 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 193 transitions. Word has length 17 [2021-10-13 01:01:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:19,905 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 193 transitions. [2021-10-13 01:01:19,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 193 transitions. [2021-10-13 01:01:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:19,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:19,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:19,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:01:19,907 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 01:01:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1262518568, now seen corresponding path program 2 times [2021-10-13 01:01:19,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:19,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587360227] [2021-10-13 01:01:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:19,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:20,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:20,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587360227] [2021-10-13 01:01:20,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587360227] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:20,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:20,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:01:20,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845888921] [2021-10-13 01:01:20,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:01:20,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:01:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:01:20,496 INFO L87 Difference]: Start difference. First operand 104 states and 193 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:21,191 INFO L93 Difference]: Finished difference Result 156 states and 268 transitions. [2021-10-13 01:01:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:01:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:21,193 INFO L225 Difference]: With dead ends: 156 [2021-10-13 01:01:21,193 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 01:01:21,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 451.3ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-10-13 01:01:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 01:01:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2021-10-13 01:01:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.8461538461538463) internal successors, (216), 118 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 216 transitions. [2021-10-13 01:01:21,200 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 216 transitions. Word has length 17 [2021-10-13 01:01:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:21,200 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 216 transitions. [2021-10-13 01:01:21,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2021-10-13 01:01:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:21,202 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:21,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:21,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:01:21,203 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 01:01:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1262518590, now seen corresponding path program 2 times [2021-10-13 01:01:21,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:21,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990825203] [2021-10-13 01:01:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:21,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:21,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:21,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990825203] [2021-10-13 01:01:21,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990825203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:21,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:21,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:01:21,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335354938] [2021-10-13 01:01:21,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:01:21,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:01:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:01:21,393 INFO L87 Difference]: Start difference. First operand 119 states and 216 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:21,543 INFO L93 Difference]: Finished difference Result 170 states and 289 transitions. [2021-10-13 01:01:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:01:21,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:21,545 INFO L225 Difference]: With dead ends: 170 [2021-10-13 01:01:21,545 INFO L226 Difference]: Without dead ends: 157 [2021-10-13 01:01:21,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:01:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-10-13 01:01:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 108. [2021-10-13 01:01:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.8867924528301887) internal successors, (200), 107 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 200 transitions. [2021-10-13 01:01:21,551 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 200 transitions. Word has length 17 [2021-10-13 01:01:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:21,551 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 200 transitions. [2021-10-13 01:01:21,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 200 transitions. [2021-10-13 01:01:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:21,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:21,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:21,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:01:21,553 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 01:01:21,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1971188852, now seen corresponding path program 3 times [2021-10-13 01:01:21,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:21,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759078677] [2021-10-13 01:01:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:21,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:22,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:22,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759078677] [2021-10-13 01:01:22,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759078677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:22,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:22,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:01:22,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120728848] [2021-10-13 01:01:22,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:01:22,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:01:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:01:22,003 INFO L87 Difference]: Start difference. First operand 108 states and 200 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:22,626 INFO L93 Difference]: Finished difference Result 165 states and 271 transitions. [2021-10-13 01:01:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:01:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:22,631 INFO L225 Difference]: With dead ends: 165 [2021-10-13 01:01:22,631 INFO L226 Difference]: Without dead ends: 158 [2021-10-13 01:01:22,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 382.7ms TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:01:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-13 01:01:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2021-10-13 01:01:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.8679245283018868) internal successors, (198), 107 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 198 transitions. [2021-10-13 01:01:22,637 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 198 transitions. Word has length 17 [2021-10-13 01:01:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:22,638 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 198 transitions. [2021-10-13 01:01:22,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 198 transitions. [2021-10-13 01:01:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:22,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:22,639 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:22,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:01:22,640 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 01:01:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1472634312, now seen corresponding path program 4 times [2021-10-13 01:01:22,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:22,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335841078] [2021-10-13 01:01:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:22,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:23,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:23,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335841078] [2021-10-13 01:01:23,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335841078] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:23,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:23,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:01:23,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894173150] [2021-10-13 01:01:23,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:01:23,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:01:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:01:23,076 INFO L87 Difference]: Start difference. First operand 108 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:23,752 INFO L93 Difference]: Finished difference Result 161 states and 267 transitions. [2021-10-13 01:01:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:01:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:23,754 INFO L225 Difference]: With dead ends: 161 [2021-10-13 01:01:23,754 INFO L226 Difference]: Without dead ends: 144 [2021-10-13 01:01:23,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 439.4ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:01:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-13 01:01:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2021-10-13 01:01:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.8775510204081634) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2021-10-13 01:01:23,760 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 17 [2021-10-13 01:01:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:23,760 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2021-10-13 01:01:23,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2021-10-13 01:01:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:23,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:23,762 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:23,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:01:23,762 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 01:01:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1231075460, now seen corresponding path program 5 times [2021-10-13 01:01:23,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:23,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988151473] [2021-10-13 01:01:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:23,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:24,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:24,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988151473] [2021-10-13 01:01:24,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988151473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:24,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:24,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:01:24,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327041037] [2021-10-13 01:01:24,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:01:24,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:01:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:01:24,166 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:24,706 INFO L93 Difference]: Finished difference Result 185 states and 316 transitions. [2021-10-13 01:01:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:01:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:24,722 INFO L225 Difference]: With dead ends: 185 [2021-10-13 01:01:24,722 INFO L226 Difference]: Without dead ends: 168 [2021-10-13 01:01:24,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 360.4ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:01:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-10-13 01:01:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 104. [2021-10-13 01:01:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.8627450980392157) internal successors, (190), 103 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 190 transitions. [2021-10-13 01:01:24,728 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 190 transitions. Word has length 17 [2021-10-13 01:01:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:24,728 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 190 transitions. [2021-10-13 01:01:24,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 190 transitions. [2021-10-13 01:01:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:24,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:24,730 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:24,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:01:24,730 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 01:01:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:24,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1963202090, now seen corresponding path program 6 times [2021-10-13 01:01:24,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:24,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962925810] [2021-10-13 01:01:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:24,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:01:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:01:25,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:01:25,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962925810] [2021-10-13 01:01:25,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962925810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:01:25,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:01:25,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:01:25,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456201872] [2021-10-13 01:01:25,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:01:25,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:01:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:01:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:01:25,138 INFO L87 Difference]: Start difference. First operand 104 states and 190 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:01:25,606 INFO L93 Difference]: Finished difference Result 164 states and 281 transitions. [2021-10-13 01:01:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:01:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 01:01:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:01:25,607 INFO L225 Difference]: With dead ends: 164 [2021-10-13 01:01:25,607 INFO L226 Difference]: Without dead ends: 151 [2021-10-13 01:01:25,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 337.8ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:01:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-13 01:01:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2021-10-13 01:01:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.854368932038835) internal successors, (191), 104 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 191 transitions. [2021-10-13 01:01:25,612 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 191 transitions. Word has length 17 [2021-10-13 01:01:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:01:25,613 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 191 transitions. [2021-10-13 01:01:25,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:01:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 191 transitions. [2021-10-13 01:01:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:01:25,614 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:01:25,614 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:01:25,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:01:25,614 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 01:01:25,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:01:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1015607902, now seen corresponding path program 7 times [2021-10-13 01:01:25,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:01:25,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049371181] [2021-10-13 01:01:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:01:25,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:01:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:01:25,661 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:01:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:01:25,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:01:25,730 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:01:25,731 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:01:25,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 01:01:25,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 01:01:25,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:01:25,739 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 01:01:25,740 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:01:25,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:01:25 BasicIcfg [2021-10-13 01:01:25,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:01:25,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:01:25,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:01:25,792 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:01:25,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:00:17" (3/4) ... [2021-10-13 01:01:25,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:01:25,879 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:01:25,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:01:25,881 INFO L168 Benchmark]: Toolchain (without parser) took 70457.59 ms. Allocated memory was 92.3 MB in the beginning and 159.4 MB in the end (delta: 67.1 MB). Free memory was 67.4 MB in the beginning and 118.1 MB in the end (delta: -50.7 MB). Peak memory consumption was 100.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,881 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 92.3 MB. Free memory was 67.2 MB in the beginning and 67.2 MB in the end (delta: 53.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:01:25,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1020.39 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 67.2 MB in the beginning and 78.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 41.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 117.4 MB. Free memory was 78.2 MB in the beginning and 75.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,882 INFO L168 Benchmark]: Boogie Preprocessor took 49.86 ms. Allocated memory is still 117.4 MB. Free memory was 75.1 MB in the beginning and 72.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,883 INFO L168 Benchmark]: RCFGBuilder took 767.39 ms. Allocated memory is still 117.4 MB. Free memory was 72.4 MB in the beginning and 86.0 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,883 INFO L168 Benchmark]: TraceAbstraction took 68456.66 ms. Allocated memory was 117.4 MB in the beginning and 159.4 MB in the end (delta: 41.9 MB). Free memory was 85.6 MB in the beginning and 40.6 MB in the end (delta: 45.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,884 INFO L168 Benchmark]: Witness Printer took 87.26 ms. Allocated memory is still 159.4 MB. Free memory was 40.6 MB in the beginning and 118.1 MB in the end (delta: -77.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:01:25,886 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.13 ms. Allocated memory is still 92.3 MB. Free memory was 67.2 MB in the beginning and 67.2 MB in the end (delta: 53.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1020.39 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 67.2 MB in the beginning and 78.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 41.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.26 ms. Allocated memory is still 117.4 MB. Free memory was 78.2 MB in the beginning and 75.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.86 ms. Allocated memory is still 117.4 MB. Free memory was 75.1 MB in the beginning and 72.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 767.39 ms. Allocated memory is still 117.4 MB. Free memory was 72.4 MB in the beginning and 86.0 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 68456.66 ms. Allocated memory was 117.4 MB in the beginning and 159.4 MB in the end (delta: 41.9 MB). Free memory was 85.6 MB in the beginning and 40.6 MB in the end (delta: 45.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 16.1 GB. * Witness Printer took 87.26 ms. Allocated memory is still 159.4 MB. Free memory was 40.6 MB in the beginning and 118.1 MB in the end (delta: -77.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58785.0ms, 158 PlacesBefore, 35 PlacesAfterwards, 160 TransitionsBefore, 31 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 8 FixpointIterations, 113 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 198 TotalNumberOfCompositions, 3822 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1777, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1270, positive: 1212, positive conditional: 0, positive unconditional: 1212, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1270, positive: 1211, positive conditional: 0, positive unconditional: 1211, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38955, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 423, negative conditional: 0, negative unconditional: 423, unknown: 38477, unknown conditional: 0, unknown unconditional: 38477] ], Cache Queries: [ total: 1777, positive: 402, positive conditional: 0, positive unconditional: 402, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1270, unknown conditional: 0, unknown unconditional: 1270] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] 0 data->shared.a [L1675] COND FALSE 0 !(!expression) [L1708] 0 data->shared.b [L1675] COND FALSE 0 !(!expression) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1740] 0 data.shared.a [L1675] COND FALSE 0 !(!expression) [L1741] 0 data.shared.b [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 68277.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 19.2ms, AutomataDifference: 4651.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 58866.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 226 SDtfs, 395 SDslu, 529 SDs, 0 SdLazy, 1842 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2178.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2871.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=3, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 131.8ms AutomataMinimizationTime, 12 MinimizatonAttempts, 395 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.5ms SsaConstructionTime, 597.4ms SatisfiabilityAnalysisTime, 3433.0ms InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 2969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:01:25,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aea0e96-2d4f-4161-973b-9f8849565fff/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...