./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.0-a4ecdab [2020-11-30 01:16:27,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:16:27,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:16:27,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:16:27,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:16:27,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:16:27,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:16:27,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:16:27,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:16:27,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:16:27,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:16:27,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:16:27,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:16:27,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:16:27,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:16:27,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:16:27,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:16:27,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:16:27,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:16:27,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:16:27,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:16:27,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:16:27,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:16:27,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:16:27,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:16:27,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:16:27,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:16:27,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:16:27,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:16:27,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:16:27,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:16:27,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:16:27,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:16:27,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:16:27,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:16:27,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:16:27,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:16:27,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:16:27,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:16:27,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:16:27,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:16:27,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:16:27,436 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:16:27,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:16:27,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:16:27,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:16:27,439 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:16:27,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:16:27,440 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:16:27,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:16:27,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:16:27,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:16:27,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:16:27,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:16:27,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:16:27,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:16:27,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:16:27,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:16:27,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:16:27,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:16:27,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:16:27,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:16:27,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:16:27,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:16:27,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:16:27,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:16:27,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:16:27,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:16:27,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:16:27,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:16:27,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:16:27,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f642aa2c8450a6773cb633057d1c74c446cbd236 [2020-11-30 01:16:27,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:16:27,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:16:27,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:16:27,744 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:16:27,752 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:16:27,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2020-11-30 01:16:27,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/data/0a03e2c6d/b6ac8cddf166423fb10cb71b882d24df/FLAG288794845 [2020-11-30 01:16:28,600 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:16:28,600 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2020-11-30 01:16:28,634 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/data/0a03e2c6d/b6ac8cddf166423fb10cb71b882d24df/FLAG288794845 [2020-11-30 01:16:28,782 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/data/0a03e2c6d/b6ac8cddf166423fb10cb71b882d24df [2020-11-30 01:16:28,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:16:28,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:16:28,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:16:28,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:16:28,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:16:28,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:16:28" (1/1) ... [2020-11-30 01:16:28,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132f4f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:28, skipping insertion in model container [2020-11-30 01:16:28,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:16:28" (1/1) ... [2020-11-30 01:16:28,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:16:28,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:16:29,087 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-30 01:16:29,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:16:29,784 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:16:29,796 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-30 01:16:29,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:16:30,261 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:16:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30 WrapperNode [2020-11-30 01:16:30,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:16:30,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:16:30,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:16:30,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:16:30,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:16:30,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:16:30,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:16:30,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:16:30,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... [2020-11-30 01:16:30,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:16:30,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:16:30,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:16:30,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:16:30,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:16:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:16:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:16:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-30 01:16:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-30 01:16:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:16:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:16:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:16:30,500 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:16:31,285 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:16:31,285 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-30 01:16:31,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:31 BoogieIcfgContainer [2020-11-30 01:16:31,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:16:31,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:16:31,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:16:31,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:16:31,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:16:28" (1/3) ... [2020-11-30 01:16:31,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14919745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:16:31, skipping insertion in model container [2020-11-30 01:16:31,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:30" (2/3) ... [2020-11-30 01:16:31,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14919745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:16:31, skipping insertion in model container [2020-11-30 01:16:31,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:31" (3/3) ... [2020-11-30 01:16:31,315 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-11-30 01:16:31,326 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:16:31,326 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:16:31,331 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-30 01:16:31,332 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:16:31,379 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,379 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,379 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,379 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,380 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,381 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,382 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,383 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,383 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,384 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,384 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,384 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,384 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,384 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,385 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,386 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,387 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,388 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,389 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,389 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,389 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,394 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,395 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,395 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,395 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,396 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,396 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,397 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,400 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,400 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,401 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,402 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,402 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:16:31,417 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-30 01:16:31,429 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-30 01:16:31,461 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:16:31,461 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:16:31,461 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:16:31,462 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:16:31,462 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:16:31,462 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:16:31,462 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:16:31,462 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:16:31,487 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:16:31,490 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 180 transitions, 382 flow [2020-11-30 01:16:31,494 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 180 transitions, 382 flow [2020-11-30 01:16:31,496 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 170 places, 180 transitions, 382 flow [2020-11-30 01:16:31,603 INFO L129 PetriNetUnfolder]: 19/228 cut-off events. [2020-11-30 01:16:31,603 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-30 01:16:31,612 INFO L80 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 228 events. 19/228 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 127. Up to 4 conditions per place. [2020-11-30 01:16:31,619 INFO L116 LiptonReduction]: Number of co-enabled transitions 2124 [2020-11-30 01:16:32,788 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:32,824 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:32,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:32,864 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:32,895 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:32,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:32,915 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:36,113 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:36,147 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:36,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,168 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:36,186 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:36,215 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:36,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:36,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:38,288 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:38,324 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:38,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,355 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:38,376 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:38,400 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:38,428 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:38,429 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:40,558 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:40,611 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:40,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,638 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-11-30 01:16:40,655 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:40,681 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:40,698 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:40,698 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-30 01:16:42,952 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:42,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:42,986 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:43,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:43,013 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:43,013 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-30 01:16:43,027 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:43,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:43,096 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:43,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:43,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:43,128 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-30 01:16:45,164 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:45,212 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:45,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,239 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-30 01:16:45,271 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:45,303 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:45,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:45,339 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-30 01:16:47,371 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:47,399 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:47,444 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,444 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-30 01:16:47,464 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:47,492 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:47,513 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:47,513 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-30 01:16:49,633 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:49,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:49,662 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:49,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:49,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:49,679 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-11-30 01:16:50,066 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:50,097 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:50,112 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,113 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:50,129 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:50,166 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:50,180 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:50,181 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:16:52,465 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:52,499 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:52,521 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,521 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-11-30 01:16:52,553 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:52,593 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:52,624 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:52,625 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-11-30 01:16:55,204 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-11-30 01:16:55,211 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:55,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:55,298 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:55,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:16:55,361 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:16:55,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:129 [2020-11-30 01:16:55,475 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-30 01:16:55,598 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-30 01:16:56,028 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 01:16:56,138 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 01:16:56,336 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-11-30 01:16:57,334 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2020-11-30 01:16:57,676 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-30 01:16:58,294 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 139 [2020-11-30 01:16:58,518 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-30 01:16:59,359 WARN L193 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 163 [2020-11-30 01:16:59,822 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-11-30 01:17:01,234 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2020-11-30 01:17:01,270 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:17:01,914 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-30 01:17:01,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:17:01,922 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:17:02,514 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-30 01:17:02,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:17:02,515 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:17:02,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-30 01:17:03,146 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-30 01:17:03,151 INFO L131 LiptonReduction]: Checked pairs total: 4784 [2020-11-30 01:17:03,151 INFO L133 LiptonReduction]: Total number of compositions: 229 [2020-11-30 01:17:03,156 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-11-30 01:17:03,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-11-30 01:17:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-11-30 01:17:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-30 01:17:03,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:03,181 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-30 01:17:03,181 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash 696, now seen corresponding path program 1 times [2020-11-30 01:17:03,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:03,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960912544] [2020-11-30 01:17:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:03,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960912544] [2020-11-30 01:17:03,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:03,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-30 01:17:03,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148682385] [2020-11-30 01:17:03,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 01:17:03,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:17:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:17:03,461 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-11-30 01:17:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:03,500 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-11-30 01:17:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:17:03,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-30 01:17:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:03,519 INFO L225 Difference]: With dead ends: 190 [2020-11-30 01:17:03,520 INFO L226 Difference]: Without dead ends: 172 [2020-11-30 01:17:03,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:17:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-30 01:17:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-11-30 01:17:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-30 01:17:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-11-30 01:17:03,604 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-11-30 01:17:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:03,605 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-11-30 01:17:03,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 01:17:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-11-30 01:17:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:17:03,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:03,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:17:03,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:17:03,606 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 662913661, now seen corresponding path program 1 times [2020-11-30 01:17:03,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:03,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605712303] [2020-11-30 01:17:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:03,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605712303] [2020-11-30 01:17:03,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:17:03,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975145029] [2020-11-30 01:17:03,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:03,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:03,853 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 4 states. [2020-11-30 01:17:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:04,038 INFO L93 Difference]: Finished difference Result 245 states and 540 transitions. [2020-11-30 01:17:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:17:04,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-30 01:17:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:04,042 INFO L225 Difference]: With dead ends: 245 [2020-11-30 01:17:04,042 INFO L226 Difference]: Without dead ends: 245 [2020-11-30 01:17:04,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:17:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-30 01:17:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 215. [2020-11-30 01:17:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-30 01:17:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 481 transitions. [2020-11-30 01:17:04,076 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 481 transitions. Word has length 5 [2020-11-30 01:17:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:04,076 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 481 transitions. [2020-11-30 01:17:04,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 481 transitions. [2020-11-30 01:17:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:17:04,077 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:04,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:17:04,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:17:04,078 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash 662913705, now seen corresponding path program 1 times [2020-11-30 01:17:04,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:04,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90719650] [2020-11-30 01:17:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:04,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90719650] [2020-11-30 01:17:04,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:04,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:17:04,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109634832] [2020-11-30 01:17:04,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:17:04,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:17:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:04,207 INFO L87 Difference]: Start difference. First operand 215 states and 481 transitions. Second operand 3 states. [2020-11-30 01:17:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:04,297 INFO L93 Difference]: Finished difference Result 273 states and 595 transitions. [2020-11-30 01:17:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:17:04,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 01:17:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:04,300 INFO L225 Difference]: With dead ends: 273 [2020-11-30 01:17:04,301 INFO L226 Difference]: Without dead ends: 266 [2020-11-30 01:17:04,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-11-30 01:17:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2020-11-30 01:17:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-30 01:17:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 565 transitions. [2020-11-30 01:17:04,316 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 565 transitions. Word has length 5 [2020-11-30 01:17:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:04,316 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 565 transitions. [2020-11-30 01:17:04,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:17:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 565 transitions. [2020-11-30 01:17:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:17:04,319 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:04,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:04,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:17:04,319 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1228481577, now seen corresponding path program 1 times [2020-11-30 01:17:04,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:04,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488695646] [2020-11-30 01:17:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:04,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488695646] [2020-11-30 01:17:04,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:04,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:17:04,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422448740] [2020-11-30 01:17:04,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:17:04,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:17:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:04,386 INFO L87 Difference]: Start difference. First operand 251 states and 565 transitions. Second operand 3 states. [2020-11-30 01:17:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:04,406 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-11-30 01:17:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:17:04,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 01:17:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:04,407 INFO L225 Difference]: With dead ends: 86 [2020-11-30 01:17:04,407 INFO L226 Difference]: Without dead ends: 86 [2020-11-30 01:17:04,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-30 01:17:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-11-30 01:17:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:17:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-11-30 01:17:04,416 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 10 [2020-11-30 01:17:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:04,416 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-11-30 01:17:04,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:17:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-11-30 01:17:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:04,418 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:04,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:04,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:17:04,419 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 812693998, now seen corresponding path program 1 times [2020-11-30 01:17:04,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:04,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578023858] [2020-11-30 01:17:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:05,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578023858] [2020-11-30 01:17:05,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:05,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:17:05,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918858725] [2020-11-30 01:17:05,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:17:05,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:17:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:17:05,109 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 12 states. [2020-11-30 01:17:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:06,232 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2020-11-30 01:17:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:17:06,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-11-30 01:17:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:06,234 INFO L225 Difference]: With dead ends: 141 [2020-11-30 01:17:06,234 INFO L226 Difference]: Without dead ends: 141 [2020-11-30 01:17:06,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:17:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-30 01:17:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2020-11-30 01:17:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-30 01:17:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 195 transitions. [2020-11-30 01:17:06,239 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 195 transitions. Word has length 18 [2020-11-30 01:17:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:06,239 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 195 transitions. [2020-11-30 01:17:06,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:17:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 195 transitions. [2020-11-30 01:17:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:06,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:06,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:06,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:17:06,241 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 812693963, now seen corresponding path program 1 times [2020-11-30 01:17:06,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:06,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234014951] [2020-11-30 01:17:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:06,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234014951] [2020-11-30 01:17:06,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:06,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:17:06,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115235631] [2020-11-30 01:17:06,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:17:06,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:17:06,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:17:06,513 INFO L87 Difference]: Start difference. First operand 105 states and 195 transitions. Second operand 7 states. [2020-11-30 01:17:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:06,822 INFO L93 Difference]: Finished difference Result 161 states and 281 transitions. [2020-11-30 01:17:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:17:06,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-11-30 01:17:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:06,825 INFO L225 Difference]: With dead ends: 161 [2020-11-30 01:17:06,825 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 01:17:06,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:17:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 01:17:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2020-11-30 01:17:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-30 01:17:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 193 transitions. [2020-11-30 01:17:06,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 193 transitions. Word has length 18 [2020-11-30 01:17:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:06,829 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 193 transitions. [2020-11-30 01:17:06,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:17:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 193 transitions. [2020-11-30 01:17:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:06,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:06,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:06,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:17:06,831 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 504597830, now seen corresponding path program 2 times [2020-11-30 01:17:06,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:06,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455455643] [2020-11-30 01:17:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:07,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455455643] [2020-11-30 01:17:07,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:07,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:17:07,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024124915] [2020-11-30 01:17:07,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:17:07,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:17:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:17:07,361 INFO L87 Difference]: Start difference. First operand 105 states and 193 transitions. Second operand 12 states. [2020-11-30 01:17:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:08,291 INFO L93 Difference]: Finished difference Result 148 states and 250 transitions. [2020-11-30 01:17:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:17:08,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-11-30 01:17:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:08,293 INFO L225 Difference]: With dead ends: 148 [2020-11-30 01:17:08,293 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 01:17:08,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:17:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 01:17:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-11-30 01:17:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:17:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2020-11-30 01:17:08,297 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2020-11-30 01:17:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:08,297 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2020-11-30 01:17:08,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:17:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2020-11-30 01:17:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:08,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:08,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:08,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:17:08,299 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 732366662, now seen corresponding path program 3 times [2020-11-30 01:17:08,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:08,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932916229] [2020-11-30 01:17:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:08,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932916229] [2020-11-30 01:17:08,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:08,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:17:08,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282777590] [2020-11-30 01:17:08,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:17:08,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:17:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:17:08,848 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand 12 states. [2020-11-30 01:17:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:09,806 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2020-11-30 01:17:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:17:09,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-11-30 01:17:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:09,808 INFO L225 Difference]: With dead ends: 152 [2020-11-30 01:17:09,808 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 01:17:09,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:17:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 01:17:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 107. [2020-11-30 01:17:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-30 01:17:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-11-30 01:17:09,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-11-30 01:17:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:09,816 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-11-30 01:17:09,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:17:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-11-30 01:17:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:09,818 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:09,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:09,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:17:09,819 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash 732366627, now seen corresponding path program 2 times [2020-11-30 01:17:09,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:09,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092978216] [2020-11-30 01:17:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:10,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092978216] [2020-11-30 01:17:10,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:10,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:17:10,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76612847] [2020-11-30 01:17:10,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:17:10,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:17:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:17:10,003 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 7 states. [2020-11-30 01:17:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:10,303 INFO L93 Difference]: Finished difference Result 154 states and 274 transitions. [2020-11-30 01:17:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:17:10,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-11-30 01:17:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:10,305 INFO L225 Difference]: With dead ends: 154 [2020-11-30 01:17:10,305 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 01:17:10,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:17:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 01:17:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2020-11-30 01:17:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 01:17:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-11-30 01:17:10,309 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-11-30 01:17:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:10,310 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-11-30 01:17:10,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:17:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-11-30 01:17:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:10,313 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:10,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:10,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:17:10,313 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1298936116, now seen corresponding path program 4 times [2020-11-30 01:17:10,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:10,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989280077] [2020-11-30 01:17:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:10,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989280077] [2020-11-30 01:17:10,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:10,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:17:10,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923790566] [2020-11-30 01:17:10,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:17:10,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:17:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:17:10,653 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-11-30 01:17:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:11,301 INFO L93 Difference]: Finished difference Result 200 states and 332 transitions. [2020-11-30 01:17:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:17:11,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-11-30 01:17:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:11,309 INFO L225 Difference]: With dead ends: 200 [2020-11-30 01:17:11,309 INFO L226 Difference]: Without dead ends: 200 [2020-11-30 01:17:11,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2020-11-30 01:17:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-30 01:17:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 123. [2020-11-30 01:17:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-30 01:17:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 220 transitions. [2020-11-30 01:17:11,316 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 220 transitions. Word has length 18 [2020-11-30 01:17:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:11,317 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 220 transitions. [2020-11-30 01:17:11,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:17:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 220 transitions. [2020-11-30 01:17:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:11,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:11,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:11,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:17:11,318 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1298936151, now seen corresponding path program 3 times [2020-11-30 01:17:11,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:11,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990280928] [2020-11-30 01:17:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:11,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990280928] [2020-11-30 01:17:11,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:11,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:17:11,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754780531] [2020-11-30 01:17:11,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:17:11,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:17:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:17:11,521 INFO L87 Difference]: Start difference. First operand 123 states and 220 transitions. Second operand 9 states. [2020-11-30 01:17:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:11,995 INFO L93 Difference]: Finished difference Result 196 states and 329 transitions. [2020-11-30 01:17:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:17:11,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-11-30 01:17:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:11,997 INFO L225 Difference]: With dead ends: 196 [2020-11-30 01:17:11,997 INFO L226 Difference]: Without dead ends: 179 [2020-11-30 01:17:11,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:17:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-30 01:17:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 126. [2020-11-30 01:17:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-11-30 01:17:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 232 transitions. [2020-11-30 01:17:12,003 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 232 transitions. Word has length 18 [2020-11-30 01:17:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:12,003 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 232 transitions. [2020-11-30 01:17:12,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:17:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 232 transitions. [2020-11-30 01:17:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:12,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:12,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:12,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:17:12,010 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1607032284, now seen corresponding path program 5 times [2020-11-30 01:17:12,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:12,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360123313] [2020-11-30 01:17:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:12,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360123313] [2020-11-30 01:17:12,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:12,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:17:12,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763522255] [2020-11-30 01:17:12,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:17:12,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:12,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:17:12,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:17:12,334 INFO L87 Difference]: Start difference. First operand 126 states and 232 transitions. Second operand 11 states. [2020-11-30 01:17:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:13,005 INFO L93 Difference]: Finished difference Result 207 states and 351 transitions. [2020-11-30 01:17:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:17:13,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-11-30 01:17:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:13,007 INFO L225 Difference]: With dead ends: 207 [2020-11-30 01:17:13,007 INFO L226 Difference]: Without dead ends: 188 [2020-11-30 01:17:13,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:17:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-30 01:17:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 124. [2020-11-30 01:17:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-30 01:17:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 227 transitions. [2020-11-30 01:17:13,012 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 227 transitions. Word has length 18 [2020-11-30 01:17:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:13,013 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 227 transitions. [2020-11-30 01:17:13,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:17:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 227 transitions. [2020-11-30 01:17:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:13,013 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:13,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:13,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:17:13,014 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 860363524, now seen corresponding path program 6 times [2020-11-30 01:17:13,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:13,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293300380] [2020-11-30 01:17:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:17:13,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293300380] [2020-11-30 01:17:13,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:13,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:17:13,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489180165] [2020-11-30 01:17:13,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:17:13,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:17:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:17:13,328 INFO L87 Difference]: Start difference. First operand 124 states and 227 transitions. Second operand 11 states. [2020-11-30 01:17:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:13,914 INFO L93 Difference]: Finished difference Result 210 states and 355 transitions. [2020-11-30 01:17:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:17:13,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-11-30 01:17:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:13,915 INFO L225 Difference]: With dead ends: 210 [2020-11-30 01:17:13,915 INFO L226 Difference]: Without dead ends: 193 [2020-11-30 01:17:13,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-11-30 01:17:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-11-30 01:17:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2020-11-30 01:17:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-30 01:17:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 228 transitions. [2020-11-30 01:17:13,921 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 228 transitions. Word has length 18 [2020-11-30 01:17:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:13,922 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 228 transitions. [2020-11-30 01:17:13,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:17:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 228 transitions. [2020-11-30 01:17:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:17:13,923 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:13,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:13,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:17:13,923 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1591753508, now seen corresponding path program 7 times [2020-11-30 01:17:13,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:13,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726230229] [2020-11-30 01:17:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:17:13,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:17:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:17:14,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:17:14,049 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:17:14,050 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:17:14,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:17:14,050 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 01:17:14,050 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 01:17:14,051 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-30 01:17:14,056 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] ULTIMATE.startENTRY-->L1708-2: Formula: (let ((.cse0 (store |#valid_In-593273553| 0 0))) (let ((.cse3 (store .cse0 |#t~string6.base_Out-593273553| 1))) (let ((.cse6 (store .cse3 |#t~string7.base_Out-593273553| 1))) (let ((.cse5 (store .cse6 |~#t1~0.base_Out-593273553| 1))) (let ((.cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 24)) (.cse2 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 28)) (.cse4 (store .cse5 |~#t2~0.base_Out-593273553| 1)) (.cse7 (select |#memory_int_In-593273553| |#t~string6.base_Out-593273553|))) (and (= |#NULL.offset_Out-593273553| 0) (= |ULTIMATE.start_main_~#data~1.offset_Out-593273553| 0) (= (select .cse0 |#t~string6.base_Out-593273553|) 0) (= (select (select |#memory_int_In-593273553| |~#t1~0.base_Out-593273553|) |~#t1~0.offset_Out-593273553|) 0) (< 0 |#StackHeapBarrier_In-593273553|) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-593273553| 1) (< |#StackHeapBarrier_In-593273553| |#t~string7.base_Out-593273553|) (= ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 |ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553|) (= |#memory_int_Out-593273553| (store |#memory_int_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_int_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 0) .cse2 0))) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_In-593273553| |ULTIMATE.start_reach_error_#t~nondet8.offset_Out-593273553|) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553| ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553) (= (select .cse3 |#t~string7.base_Out-593273553|) 0) (= (store |#memory_$Pointer$.offset_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_$Pointer$.offset_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 v_DerPreprocessor_62) .cse2 (select (select |#memory_$Pointer$.offset_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2))) |#memory_$Pointer$.offset_Out-593273553|) (= |ULTIMATE.start_my_drv_probe_#t~mem11_Out-593273553| (select (select |#memory_int_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2)) (= |#valid_Out-593273553| (store .cse4 |ULTIMATE.start_main_~#data~1.base_Out-593273553| 1)) (= |#t~string7.offset_Out-593273553| 0) (< |#StackHeapBarrier_In-593273553| |ULTIMATE.start_main_~#data~1.base_Out-593273553|) (< |#StackHeapBarrier_In-593273553| |#t~string6.base_Out-593273553|) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In-593273553| |ULTIMATE.start_reach_error_#t~nondet8.base_Out-593273553|) (= (select .cse5 |~#t2~0.base_Out-593273553|) 0) (= (select (select |#memory_int_In-593273553| |~#t2~0.base_Out-593273553|) |~#t2~0.offset_Out-593273553|) 0) (= ~my_dev~0.base_Out-593273553 0) (= ~my_dev~0.offset_Out-593273553 0) (= |ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553| |ULTIMATE.start_main_~#data~1.base_Out-593273553|) (= |#memory_$Pointer$.base_Out-593273553| (store |#memory_$Pointer$.base_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_$Pointer$.base_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 v_DerPreprocessor_61) .cse2 (select (select |#memory_$Pointer$.base_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2)))) (= (select .cse6 |~#t1~0.base_Out-593273553|) 0) (= 48 (select .cse7 |#t~string6.offset_Out-593273553|)) (= |ULTIMATE.start_my_drv_init_#res_Out-593273553| ULTIMATE.start_main_~ret~0_Out-593273553) (= (select .cse4 |ULTIMATE.start_main_~#data~1.base_Out-593273553|) 0) (= (select .cse7 (+ |#t~string6.offset_Out-593273553| 1)) 0) (= (store (store (store (store (store |#length_In-593273553| |#t~string6.base_Out-593273553| 2) |#t~string7.base_Out-593273553| 31) |~#t1~0.base_Out-593273553| 4) |~#t2~0.base_Out-593273553| 4) |ULTIMATE.start_main_~#data~1.base_Out-593273553| 32) |#length_Out-593273553|) (= ULTIMATE.start_ldv_assert_~expression_Out-593273553 1) (= |#pthreadsMutex_Out-593273553| (store |#pthreadsMutex_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (select |#pthreadsMutex_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 0))) (= |#t~string6.offset_Out-593273553| 0) (= |~#t1~0.offset_Out-593273553| 0) (= ULTIMATE.start_main_~ret~0_Out-593273553 0) (< |#StackHeapBarrier_In-593273553| |~#t2~0.base_Out-593273553|) (< |#StackHeapBarrier_In-593273553| |~#t1~0.base_Out-593273553|) (= |#NULL.base_Out-593273553| 0) (= |~#t2~0.offset_Out-593273553| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553| |ULTIMATE.start_main_~#data~1.offset_Out-593273553|))))))) InVars {#pthreadsMutex=|#pthreadsMutex_In-593273553|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In-593273553|, #StackHeapBarrier=|#StackHeapBarrier_In-593273553|, #memory_$Pointer$.base=|#memory_$Pointer$.base_In-593273553|, #valid=|#valid_In-593273553|, #memory_int=|#memory_int_In-593273553|, #length=|#length_In-593273553|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In-593273553|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_In-593273553|} OutVars{ULTIMATE.start_main_#t~mem22=|ULTIMATE.start_main_#t~mem22_Out-593273553|, ULTIMATE.start_main_#t~mem21=|ULTIMATE.start_main_#t~mem21_Out-593273553|, ULTIMATE.start_main_#t~mem24=|ULTIMATE.start_main_#t~mem24_Out-593273553|, ULTIMATE.start_main_#t~mem23=|ULTIMATE.start_main_#t~mem23_Out-593273553|, #memory_$Pointer$.base=|#memory_$Pointer$.base_Out-593273553|, ULTIMATE.start_my_drv_probe_#res=|ULTIMATE.start_my_drv_probe_#res_Out-593273553|, #NULL.offset=|#NULL.offset_Out-593273553|, ~#t1~0.offset=|~#t1~0.offset_Out-593273553|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out-593273553|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-593273553, ~#t1~0.base=|~#t1~0.base_Out-593273553|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_Out-593273553, ULTIMATE.start_my_drv_init_#res=|ULTIMATE.start_my_drv_init_#res_Out-593273553|, ~#t2~0.offset=|~#t2~0.offset_Out-593273553|, ULTIMATE.start_main_#t~ret20=|ULTIMATE.start_main_#t~ret20_Out-593273553|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_Out-593273553|, #length=|#length_Out-593273553|, ~my_dev~0.offset=~my_dev~0.offset_Out-593273553, ~#t2~0.base=|~#t2~0.base_Out-593273553|, #pthreadsMutex=|#pthreadsMutex_Out-593273553|, ULTIMATE.start_my_drv_probe_#in~data.base=|ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553|, #t~string6.base=|#t~string6.base_Out-593273553|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out-593273553|, ULTIMATE.start_main_~ret~0=ULTIMATE.start_main_~ret~0_Out-593273553, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553, ULTIMATE.start_my_drv_probe_#in~data.offset=|ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553|, ~my_dev~0.base=~my_dev~0.base_Out-593273553, ULTIMATE.start_my_drv_probe_#t~mem11=|ULTIMATE.start_my_drv_probe_#t~mem11_Out-593273553|, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_Out-593273553|, ULTIMATE.start_my_drv_probe_~res~0=ULTIMATE.start_my_drv_probe_~res~0_Out-593273553, ULTIMATE.start_my_drv_probe_#t~nondet13=|ULTIMATE.start_my_drv_probe_#t~nondet13_Out-593273553|, ULTIMATE.start_my_drv_probe_#t~nondet14=|ULTIMATE.start_my_drv_probe_#t~nondet14_Out-593273553|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-593273553|, #NULL.base=|#NULL.base_Out-593273553|, ULTIMATE.start_main_#t~ret19=|ULTIMATE.start_main_#t~ret19_Out-593273553|, #t~string7.offset=|#t~string7.offset_Out-593273553|, #StackHeapBarrier=|#StackHeapBarrier_In-593273553|, ULTIMATE.start_my_drv_probe_#t~mem10=|ULTIMATE.start_my_drv_probe_#t~mem10_Out-593273553|, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out-593273553|, #valid=|#valid_Out-593273553|, #memory_int=|#memory_int_Out-593273553|, #t~string7.base=|#t~string7.base_Out-593273553|, ULTIMATE.start_main_~probe_ret~0=ULTIMATE.start_main_~probe_ret~0_Out-593273553, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_Out-593273553|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_Out-593273553|, #t~string6.offset=|#t~string6.offset_Out-593273553|} AuxVars[v_DerPreprocessor_61, v_DerPreprocessor_62] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, #NULL.offset, ~#t1~0.offset, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_#t~ret20, ULTIMATE.start_main_~#data~1.offset, #length, ~my_dev~0.offset, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, #t~string6.base, ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_main_~ret~0, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_my_drv_probe_#in~data.offset, ~my_dev~0.base, ULTIMATE.start_my_drv_probe_#t~mem11, ULTIMATE.start_my_drv_probe_#t~nondet12, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet13, ULTIMATE.start_my_drv_probe_#t~nondet14, ULTIMATE.start_ldv_assert_#in~expression, #NULL.base, ULTIMATE.start_main_#t~ret19, #t~string7.offset, ULTIMATE.start_my_drv_probe_#t~mem10, ULTIMATE.start_main_#res, #valid, #memory_int, #t~string7.base, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset, #t~string6.offset] because there is no mapped edge [2020-11-30 01:17:14,060 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L1708-2-->L1709-2: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out2071754896 0)) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_Out2071754896| |ULTIMATE.start_reach_error_#t~nondet8.offset_In2071754896|) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| 2147483648)) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In2071754896| |ULTIMATE.start_reach_error_#t~nondet8.base_Out2071754896|) (= |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| ULTIMATE.start_my_drv_probe_~res~0_Out2071754896) (= ULTIMATE.start_ldv_assert_~expression_Out2071754896 |ULTIMATE.start_ldv_assert_#in~expression_In2071754896|) (<= |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| 2147483647)) InVars {ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In2071754896|, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In2071754896|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In2071754896|} OutVars{ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out2071754896|, ULTIMATE.start_my_drv_probe_#t~mem11=|ULTIMATE.start_my_drv_probe_#t~mem11_Out2071754896|, ULTIMATE.start_my_drv_probe_~res~0=ULTIMATE.start_my_drv_probe_~res~0_Out2071754896, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In2071754896|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out2071754896|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out2071754896} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_my_drv_probe_#t~mem11, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-11-30 01:17:14,069 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L1723-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In1754631884| |ULTIMATE.start_main_~#data~1.base_In1754631884|))) (and (= ULTIMATE.start_ldv_assert_~expression_Out1754631884 1) (= (store |#valid_In1754631884| |ULTIMATE.start_my_drv_disconnect_~#status~0.base_In1754631884| 0) |#valid_Out1754631884|) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_In1754631884| |ULTIMATE.start_reach_error_#t~nondet8.offset_Out1754631884|) (= |ULTIMATE.start_main_#t~mem22_Out1754631884| (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1754631884| 28))) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1754631884| 24)) 1) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In1754631884| |ULTIMATE.start_reach_error_#t~nondet8.base_Out1754631884|) (let ((.cse1 (= |ULTIMATE.start_main_#t~mem22_Out1754631884| 2))) (or (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out1754631884| 0)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1754631884| 1) .cse1))))) InVars {ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In1754631884|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_In1754631884|, #valid=|#valid_In1754631884|, #memory_int=|#memory_int_In1754631884|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1754631884|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1754631884|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In1754631884|} OutVars{ULTIMATE.start_main_#t~mem22=|ULTIMATE.start_main_#t~mem22_Out1754631884|, ULTIMATE.start_main_#t~mem21=|ULTIMATE.start_main_#t~mem21_Out1754631884|, ULTIMATE.start_my_drv_disconnect_#t~nondet18.base=|ULTIMATE.start_my_drv_disconnect_#t~nondet18.base_Out1754631884|, ULTIMATE.start_my_drv_disconnect_#t~mem17=|ULTIMATE.start_my_drv_disconnect_#t~mem17_Out1754631884|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out1754631884|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1754631884|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out1754631884|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1754631884, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1754631884|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1754631884|, #valid=|#valid_Out1754631884|, #memory_int=|#memory_int_In1754631884|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1754631884|, ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset=|ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset_Out1754631884|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1754631884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_my_drv_disconnect_#t~nondet18.base, ULTIMATE.start_my_drv_disconnect_#t~mem17, ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-11-30 01:17:14,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:17:14 BasicIcfg [2020-11-30 01:17:14,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:17:14,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:17:14,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:17:14,130 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:17:14,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:31" (3/4) ... [2020-11-30 01:17:14,139 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:17:14,140 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] ULTIMATE.startENTRY-->L1708-2: Formula: (let ((.cse0 (store |#valid_In-593273553| 0 0))) (let ((.cse3 (store .cse0 |#t~string6.base_Out-593273553| 1))) (let ((.cse6 (store .cse3 |#t~string7.base_Out-593273553| 1))) (let ((.cse5 (store .cse6 |~#t1~0.base_Out-593273553| 1))) (let ((.cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 24)) (.cse2 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 28)) (.cse4 (store .cse5 |~#t2~0.base_Out-593273553| 1)) (.cse7 (select |#memory_int_In-593273553| |#t~string6.base_Out-593273553|))) (and (= |#NULL.offset_Out-593273553| 0) (= |ULTIMATE.start_main_~#data~1.offset_Out-593273553| 0) (= (select .cse0 |#t~string6.base_Out-593273553|) 0) (= (select (select |#memory_int_In-593273553| |~#t1~0.base_Out-593273553|) |~#t1~0.offset_Out-593273553|) 0) (< 0 |#StackHeapBarrier_In-593273553|) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-593273553| 1) (< |#StackHeapBarrier_In-593273553| |#t~string7.base_Out-593273553|) (= ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 |ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553|) (= |#memory_int_Out-593273553| (store |#memory_int_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_int_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 0) .cse2 0))) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_In-593273553| |ULTIMATE.start_reach_error_#t~nondet8.offset_Out-593273553|) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553| ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553) (= (select .cse3 |#t~string7.base_Out-593273553|) 0) (= (store |#memory_$Pointer$.offset_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_$Pointer$.offset_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 v_DerPreprocessor_62) .cse2 (select (select |#memory_$Pointer$.offset_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2))) |#memory_$Pointer$.offset_Out-593273553|) (= |ULTIMATE.start_my_drv_probe_#t~mem11_Out-593273553| (select (select |#memory_int_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2)) (= |#valid_Out-593273553| (store .cse4 |ULTIMATE.start_main_~#data~1.base_Out-593273553| 1)) (= |#t~string7.offset_Out-593273553| 0) (< |#StackHeapBarrier_In-593273553| |ULTIMATE.start_main_~#data~1.base_Out-593273553|) (< |#StackHeapBarrier_In-593273553| |#t~string6.base_Out-593273553|) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In-593273553| |ULTIMATE.start_reach_error_#t~nondet8.base_Out-593273553|) (= (select .cse5 |~#t2~0.base_Out-593273553|) 0) (= (select (select |#memory_int_In-593273553| |~#t2~0.base_Out-593273553|) |~#t2~0.offset_Out-593273553|) 0) (= ~my_dev~0.base_Out-593273553 0) (= ~my_dev~0.offset_Out-593273553 0) (= |ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553| |ULTIMATE.start_main_~#data~1.base_Out-593273553|) (= |#memory_$Pointer$.base_Out-593273553| (store |#memory_$Pointer$.base_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (store (select |#memory_$Pointer$.base_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse1 v_DerPreprocessor_61) .cse2 (select (select |#memory_$Pointer$.base_Out-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) .cse2)))) (= (select .cse6 |~#t1~0.base_Out-593273553|) 0) (= 48 (select .cse7 |#t~string6.offset_Out-593273553|)) (= |ULTIMATE.start_my_drv_init_#res_Out-593273553| ULTIMATE.start_main_~ret~0_Out-593273553) (= (select .cse4 |ULTIMATE.start_main_~#data~1.base_Out-593273553|) 0) (= (select .cse7 (+ |#t~string6.offset_Out-593273553| 1)) 0) (= (store (store (store (store (store |#length_In-593273553| |#t~string6.base_Out-593273553| 2) |#t~string7.base_Out-593273553| 31) |~#t1~0.base_Out-593273553| 4) |~#t2~0.base_Out-593273553| 4) |ULTIMATE.start_main_~#data~1.base_Out-593273553| 32) |#length_Out-593273553|) (= ULTIMATE.start_ldv_assert_~expression_Out-593273553 1) (= |#pthreadsMutex_Out-593273553| (store |#pthreadsMutex_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553 (store (select |#pthreadsMutex_In-593273553| ULTIMATE.start_my_drv_probe_~data.base_Out-593273553) ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553 0))) (= |#t~string6.offset_Out-593273553| 0) (= |~#t1~0.offset_Out-593273553| 0) (= ULTIMATE.start_main_~ret~0_Out-593273553 0) (< |#StackHeapBarrier_In-593273553| |~#t2~0.base_Out-593273553|) (< |#StackHeapBarrier_In-593273553| |~#t1~0.base_Out-593273553|) (= |#NULL.base_Out-593273553| 0) (= |~#t2~0.offset_Out-593273553| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553| |ULTIMATE.start_main_~#data~1.offset_Out-593273553|))))))) InVars {#pthreadsMutex=|#pthreadsMutex_In-593273553|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In-593273553|, #StackHeapBarrier=|#StackHeapBarrier_In-593273553|, #memory_$Pointer$.base=|#memory_$Pointer$.base_In-593273553|, #valid=|#valid_In-593273553|, #memory_int=|#memory_int_In-593273553|, #length=|#length_In-593273553|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In-593273553|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_In-593273553|} OutVars{ULTIMATE.start_main_#t~mem22=|ULTIMATE.start_main_#t~mem22_Out-593273553|, ULTIMATE.start_main_#t~mem21=|ULTIMATE.start_main_#t~mem21_Out-593273553|, ULTIMATE.start_main_#t~mem24=|ULTIMATE.start_main_#t~mem24_Out-593273553|, ULTIMATE.start_main_#t~mem23=|ULTIMATE.start_main_#t~mem23_Out-593273553|, #memory_$Pointer$.base=|#memory_$Pointer$.base_Out-593273553|, ULTIMATE.start_my_drv_probe_#res=|ULTIMATE.start_my_drv_probe_#res_Out-593273553|, #NULL.offset=|#NULL.offset_Out-593273553|, ~#t1~0.offset=|~#t1~0.offset_Out-593273553|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out-593273553|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-593273553, ~#t1~0.base=|~#t1~0.base_Out-593273553|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_Out-593273553, ULTIMATE.start_my_drv_init_#res=|ULTIMATE.start_my_drv_init_#res_Out-593273553|, ~#t2~0.offset=|~#t2~0.offset_Out-593273553|, ULTIMATE.start_main_#t~ret20=|ULTIMATE.start_main_#t~ret20_Out-593273553|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_Out-593273553|, #length=|#length_Out-593273553|, ~my_dev~0.offset=~my_dev~0.offset_Out-593273553, ~#t2~0.base=|~#t2~0.base_Out-593273553|, #pthreadsMutex=|#pthreadsMutex_Out-593273553|, ULTIMATE.start_my_drv_probe_#in~data.base=|ULTIMATE.start_my_drv_probe_#in~data.base_Out-593273553|, #t~string6.base=|#t~string6.base_Out-593273553|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out-593273553|, ULTIMATE.start_main_~ret~0=ULTIMATE.start_main_~ret~0_Out-593273553, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_Out-593273553, ULTIMATE.start_my_drv_probe_#in~data.offset=|ULTIMATE.start_my_drv_probe_#in~data.offset_Out-593273553|, ~my_dev~0.base=~my_dev~0.base_Out-593273553, ULTIMATE.start_my_drv_probe_#t~mem11=|ULTIMATE.start_my_drv_probe_#t~mem11_Out-593273553|, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_Out-593273553|, ULTIMATE.start_my_drv_probe_~res~0=ULTIMATE.start_my_drv_probe_~res~0_Out-593273553, ULTIMATE.start_my_drv_probe_#t~nondet13=|ULTIMATE.start_my_drv_probe_#t~nondet13_Out-593273553|, ULTIMATE.start_my_drv_probe_#t~nondet14=|ULTIMATE.start_my_drv_probe_#t~nondet14_Out-593273553|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-593273553|, #NULL.base=|#NULL.base_Out-593273553|, ULTIMATE.start_main_#t~ret19=|ULTIMATE.start_main_#t~ret19_Out-593273553|, #t~string7.offset=|#t~string7.offset_Out-593273553|, #StackHeapBarrier=|#StackHeapBarrier_In-593273553|, ULTIMATE.start_my_drv_probe_#t~mem10=|ULTIMATE.start_my_drv_probe_#t~mem10_Out-593273553|, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out-593273553|, #valid=|#valid_Out-593273553|, #memory_int=|#memory_int_Out-593273553|, #t~string7.base=|#t~string7.base_Out-593273553|, ULTIMATE.start_main_~probe_ret~0=ULTIMATE.start_main_~probe_ret~0_Out-593273553, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_Out-593273553|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_Out-593273553|, #t~string6.offset=|#t~string6.offset_Out-593273553|} AuxVars[v_DerPreprocessor_61, v_DerPreprocessor_62] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, #NULL.offset, ~#t1~0.offset, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_#t~ret20, ULTIMATE.start_main_~#data~1.offset, #length, ~my_dev~0.offset, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, #t~string6.base, ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_main_~ret~0, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_my_drv_probe_#in~data.offset, ~my_dev~0.base, ULTIMATE.start_my_drv_probe_#t~mem11, ULTIMATE.start_my_drv_probe_#t~nondet12, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet13, ULTIMATE.start_my_drv_probe_#t~nondet14, ULTIMATE.start_ldv_assert_#in~expression, #NULL.base, ULTIMATE.start_main_#t~ret19, #t~string7.offset, ULTIMATE.start_my_drv_probe_#t~mem10, ULTIMATE.start_main_#res, #valid, #memory_int, #t~string7.base, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset, #t~string6.offset] because there is no mapped edge [2020-11-30 01:17:14,140 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L1708-2-->L1709-2: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out2071754896 0)) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_Out2071754896| |ULTIMATE.start_reach_error_#t~nondet8.offset_In2071754896|) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| 2147483648)) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In2071754896| |ULTIMATE.start_reach_error_#t~nondet8.base_Out2071754896|) (= |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| ULTIMATE.start_my_drv_probe_~res~0_Out2071754896) (= ULTIMATE.start_ldv_assert_~expression_Out2071754896 |ULTIMATE.start_ldv_assert_#in~expression_In2071754896|) (<= |ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896| 2147483647)) InVars {ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In2071754896|, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In2071754896|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In2071754896|} OutVars{ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out2071754896|, ULTIMATE.start_my_drv_probe_#t~mem11=|ULTIMATE.start_my_drv_probe_#t~mem11_Out2071754896|, ULTIMATE.start_my_drv_probe_~res~0=ULTIMATE.start_my_drv_probe_~res~0_Out2071754896, ULTIMATE.start_my_drv_probe_#t~nondet12=|ULTIMATE.start_my_drv_probe_#t~nondet12_In2071754896|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In2071754896|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out2071754896|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out2071754896} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_my_drv_probe_#t~mem11, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-11-30 01:17:14,146 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L1723-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In1754631884| |ULTIMATE.start_main_~#data~1.base_In1754631884|))) (and (= ULTIMATE.start_ldv_assert_~expression_Out1754631884 1) (= (store |#valid_In1754631884| |ULTIMATE.start_my_drv_disconnect_~#status~0.base_In1754631884| 0) |#valid_Out1754631884|) (= |ULTIMATE.start_reach_error_#t~nondet8.offset_In1754631884| |ULTIMATE.start_reach_error_#t~nondet8.offset_Out1754631884|) (= |ULTIMATE.start_main_#t~mem22_Out1754631884| (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1754631884| 28))) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In1754631884| 24)) 1) (= |ULTIMATE.start_reach_error_#t~nondet8.base_In1754631884| |ULTIMATE.start_reach_error_#t~nondet8.base_Out1754631884|) (let ((.cse1 (= |ULTIMATE.start_main_#t~mem22_Out1754631884| 2))) (or (and (not .cse1) (= |ULTIMATE.start_ldv_assert_#in~expression_Out1754631884| 0)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1754631884| 1) .cse1))))) InVars {ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_In1754631884|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_In1754631884|, #valid=|#valid_In1754631884|, #memory_int=|#memory_int_In1754631884|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1754631884|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1754631884|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_In1754631884|} OutVars{ULTIMATE.start_main_#t~mem22=|ULTIMATE.start_main_#t~mem22_Out1754631884|, ULTIMATE.start_main_#t~mem21=|ULTIMATE.start_main_#t~mem21_Out1754631884|, ULTIMATE.start_my_drv_disconnect_#t~nondet18.base=|ULTIMATE.start_my_drv_disconnect_#t~nondet18.base_Out1754631884|, ULTIMATE.start_my_drv_disconnect_#t~mem17=|ULTIMATE.start_my_drv_disconnect_#t~mem17_Out1754631884|, ULTIMATE.start_reach_error_#t~nondet8.base=|ULTIMATE.start_reach_error_#t~nondet8.base_Out1754631884|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1754631884|, ULTIMATE.start_reach_error_#t~nondet8.offset=|ULTIMATE.start_reach_error_#t~nondet8.offset_Out1754631884|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1754631884, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1754631884|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1754631884|, #valid=|#valid_Out1754631884|, #memory_int=|#memory_int_In1754631884|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1754631884|, ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset=|ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset_Out1754631884|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1754631884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_my_drv_disconnect_#t~nondet18.base, ULTIMATE.start_my_drv_disconnect_#t~mem17, ULTIMATE.start_reach_error_#t~nondet8.base, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet18.offset, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_reach_error_#t~nondet8.offset, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-11-30 01:17:14,193 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2876b6a4-72f3-46d5-819b-19fe54eb11f6/bin/uautomizer/witness.graphml [2020-11-30 01:17:14,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:17:14,195 INFO L168 Benchmark]: Toolchain (without parser) took 45407.92 ms. Allocated memory was 100.7 MB in the beginning and 272.6 MB in the end (delta: 172.0 MB). Free memory was 66.8 MB in the beginning and 83.1 MB in the end (delta: -16.2 MB). Peak memory consumption was 155.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,195 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 77.6 MB. Free memory was 35.7 MB in the beginning and 35.7 MB in the end (delta: 36.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:17:14,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1464.76 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 66.7 MB in the beginning and 61.2 MB in the end (delta: 5.5 MB). Peak memory consumption was 48.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.20 ms. Allocated memory is still 130.0 MB. Free memory was 61.2 MB in the beginning and 57.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,197 INFO L168 Benchmark]: Boogie Preprocessor took 78.63 ms. Allocated memory is still 130.0 MB. Free memory was 57.7 MB in the beginning and 101.3 MB in the end (delta: -43.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,197 INFO L168 Benchmark]: RCFGBuilder took 859.43 ms. Allocated memory is still 130.0 MB. Free memory was 101.3 MB in the beginning and 52.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,198 INFO L168 Benchmark]: TraceAbstraction took 42840.74 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 52.2 MB in the beginning and 90.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,198 INFO L168 Benchmark]: Witness Printer took 63.44 ms. Allocated memory is still 272.6 MB. Free memory was 90.4 MB in the beginning and 83.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:14,203 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.32 ms. Allocated memory is still 77.6 MB. Free memory was 35.7 MB in the beginning and 35.7 MB in the end (delta: 36.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1464.76 ms. Allocated memory was 100.7 MB in the beginning and 130.0 MB in the end (delta: 29.4 MB). Free memory was 66.7 MB in the beginning and 61.2 MB in the end (delta: 5.5 MB). Peak memory consumption was 48.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.20 ms. Allocated memory is still 130.0 MB. Free memory was 61.2 MB in the beginning and 57.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.63 ms. Allocated memory is still 130.0 MB. Free memory was 57.7 MB in the beginning and 101.3 MB in the end (delta: -43.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 859.43 ms. Allocated memory is still 130.0 MB. Free memory was 101.3 MB in the beginning and 52.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 42840.74 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 52.2 MB in the beginning and 90.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 16.1 GB. * Witness Printer took 63.44 ms. Allocated memory is still 272.6 MB. Free memory was 90.4 MB in the beginning and 83.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1428 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 9 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 20.0s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 31.6s, 170 PlacesBefore, 36 PlacesAfterwards, 180 TransitionsBefore, 34 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 8 FixpointIterations, 111 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 30 ConcurrentYvCompositions, 12 ChoiceCompositions, 229 TotalNumberOfCompositions, 4784 MoverChecksTotal - CounterExampleResult [Line: 1671]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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={3:24}, t1={6:0}, t2={9: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={3:24}, arg={0:0}, arg={0:0}, data={3:0}, my_dev={3:24}, t1={6:0}, t2={9: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={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9: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={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9: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; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] [L1675] COND TRUE 0 !expression [L1671] COND FALSE 0 !(0) [L1671] 0 __assert_fail ("0", "race-3_2-container_of-global.c", 14, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __mptr={3:24}, arg={0:0}, arg={0:0}, data={3:0}, lb=0, my_dev={3:24}, t1={6:0}, t2={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 154 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 31.7s, HoareTripleCheckerStatistics: 305 SDtfs, 575 SDslu, 975 SDs, 0 SdLazy, 2325 SolverSat, 292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 500 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 53523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! Received shutdown request...