./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e37bff872449928e42940d4b386c473c3ec58753 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.24-cad4683 [2019-10-22 09:02:51,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:51,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:51,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:51,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:51,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:51,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:51,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:51,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:51,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:51,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:51,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:51,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:51,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:51,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:51,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:51,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:51,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:51,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:51,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:51,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:51,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:51,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:51,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:51,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:51,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:51,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:51,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:51,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:51,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:51,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:51,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:51,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:51,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:51,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:51,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:51,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:51,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:51,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:51,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:51,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:51,236 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:51,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:51,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:51,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:51,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:51,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:51,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:51,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:51,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:51,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:51,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:51,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:51,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:51,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:51,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:51,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:51,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:51,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:51,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:51,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/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(__VERIFIER_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 -> e37bff872449928e42940d4b386c473c3ec58753 [2019-10-22 09:02:51,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:51,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:51,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:51,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:51,298 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:51,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-10-22 09:02:51,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/data/fd25b2fe8/15ee3031f48342f896421510f2235f8c/FLAGea6cf4895 [2019-10-22 09:02:51,846 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:51,849 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-10-22 09:02:51,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/data/fd25b2fe8/15ee3031f48342f896421510f2235f8c/FLAGea6cf4895 [2019-10-22 09:02:52,324 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/data/fd25b2fe8/15ee3031f48342f896421510f2235f8c [2019-10-22 09:02:52,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:52,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:52,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:52,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:52,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:52,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:52" (1/1) ... [2019-10-22 09:02:52,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0c4c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:52, skipping insertion in model container [2019-10-22 09:02:52,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:52" (1/1) ... [2019-10-22 09:02:52,345 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:52,408 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:53,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:53,127 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:53,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:53,485 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:53,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53 WrapperNode [2019-10-22 09:02:53,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:53,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:53,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:53,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:53,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:53,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:53,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:53,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:53,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... [2019-10-22 09:02:53,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:53,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:53,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:53,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:53,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/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 [2019-10-22 09:02:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:53,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-10-22 09:02:53,689 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:02:53,691 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 09:02:54,506 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:54,507 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-10-22 09:02:54,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:54 BoogieIcfgContainer [2019-10-22 09:02:54,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:54,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:54,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:54,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:54,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:52" (1/3) ... [2019-10-22 09:02:54,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fbb470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:54, skipping insertion in model container [2019-10-22 09:02:54,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:53" (2/3) ... [2019-10-22 09:02:54,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fbb470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:54, skipping insertion in model container [2019-10-22 09:02:54,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:54" (3/3) ... [2019-10-22 09:02:54,515 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2019-10-22 09:02:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,547 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,548 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,548 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,548 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,548 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,548 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,549 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,549 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,549 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,549 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,549 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,550 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,551 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,551 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,551 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,552 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,553 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,554 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,554 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,554 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,555 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,555 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,555 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,556 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,556 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,556 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,556 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,557 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,557 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,558 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,558 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,558 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,558 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,559 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,560 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,560 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,560 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,561 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,562 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,562 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:54,600 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:02:54,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:54,608 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 09:02:54,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 09:02:54,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:54,635 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:54,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:54,636 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:54,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:54,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:54,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:54,637 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:54,651 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 154 transitions [2019-10-22 09:02:55,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9148 states. [2019-10-22 09:02:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9148 states. [2019-10-22 09:02:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 09:02:55,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:55,071 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:55,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1224475003, now seen corresponding path program 1 times [2019-10-22 09:02:55,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:55,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991952845] [2019-10-22 09:02:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:55,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991952845] [2019-10-22 09:02:55,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:55,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:55,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353580027] [2019-10-22 09:02:55,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:55,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:55,564 INFO L87 Difference]: Start difference. First operand 9148 states. Second operand 6 states. [2019-10-22 09:02:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,377 INFO L93 Difference]: Finished difference Result 12891 states and 35646 transitions. [2019-10-22 09:02:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:56,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-22 09:02:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:56,464 INFO L225 Difference]: With dead ends: 12891 [2019-10-22 09:02:56,471 INFO L226 Difference]: Without dead ends: 10816 [2019-10-22 09:02:56,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:02:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-10-22 09:02:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8396. [2019-10-22 09:02:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-22 09:02:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 22955 transitions. [2019-10-22 09:02:56,841 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 22955 transitions. Word has length 43 [2019-10-22 09:02:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:56,841 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 22955 transitions. [2019-10-22 09:02:56,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 22955 transitions. [2019-10-22 09:02:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 09:02:56,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:56,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:56,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash -883751660, now seen corresponding path program 1 times [2019-10-22 09:02:56,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:56,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008523106] [2019-10-22 09:02:56,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:56,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:57,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008523106] [2019-10-22 09:02:57,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:57,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:57,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114538745] [2019-10-22 09:02:57,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:57,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:57,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:57,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:57,079 INFO L87 Difference]: Start difference. First operand 8396 states and 22955 transitions. Second operand 6 states. [2019-10-22 09:02:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:57,669 INFO L93 Difference]: Finished difference Result 11652 states and 31765 transitions. [2019-10-22 09:02:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:02:57,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-22 09:02:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:57,717 INFO L225 Difference]: With dead ends: 11652 [2019-10-22 09:02:57,723 INFO L226 Difference]: Without dead ends: 9858 [2019-10-22 09:02:57,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:02:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2019-10-22 09:02:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 9536. [2019-10-22 09:02:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9536 states. [2019-10-22 09:02:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9536 states to 9536 states and 26143 transitions. [2019-10-22 09:02:57,976 INFO L78 Accepts]: Start accepts. Automaton has 9536 states and 26143 transitions. Word has length 49 [2019-10-22 09:02:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:57,977 INFO L462 AbstractCegarLoop]: Abstraction has 9536 states and 26143 transitions. [2019-10-22 09:02:57,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9536 states and 26143 transitions. [2019-10-22 09:02:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 09:02:57,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:57,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:57,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 160387723, now seen corresponding path program 1 times [2019-10-22 09:02:57,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:57,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700194793] [2019-10-22 09:02:57,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:57,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:57,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:58,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700194793] [2019-10-22 09:02:58,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:58,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:58,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412815399] [2019-10-22 09:02:58,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:58,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:58,118 INFO L87 Difference]: Start difference. First operand 9536 states and 26143 transitions. Second operand 5 states. [2019-10-22 09:02:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:58,201 INFO L93 Difference]: Finished difference Result 3711 states and 9633 transitions. [2019-10-22 09:02:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:58,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-22 09:02:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:58,213 INFO L225 Difference]: With dead ends: 3711 [2019-10-22 09:02:58,213 INFO L226 Difference]: Without dead ends: 3711 [2019-10-22 09:02:58,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-10-22 09:02:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2019-10-22 09:02:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-10-22 09:02:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9633 transitions. [2019-10-22 09:02:58,297 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9633 transitions. Word has length 57 [2019-10-22 09:02:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:58,300 INFO L462 AbstractCegarLoop]: Abstraction has 3711 states and 9633 transitions. [2019-10-22 09:02:58,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9633 transitions. [2019-10-22 09:02:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 09:02:58,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:58,311 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:58,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1403523586, now seen corresponding path program 1 times [2019-10-22 09:02:58,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053747604] [2019-10-22 09:02:58,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:58,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053747604] [2019-10-22 09:02:58,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:58,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:58,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369829284] [2019-10-22 09:02:58,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:58,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:58,478 INFO L87 Difference]: Start difference. First operand 3711 states and 9633 transitions. Second operand 6 states. [2019-10-22 09:02:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,016 INFO L93 Difference]: Finished difference Result 4016 states and 10182 transitions. [2019-10-22 09:02:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:02:59,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-22 09:02:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:59,027 INFO L225 Difference]: With dead ends: 4016 [2019-10-22 09:02:59,027 INFO L226 Difference]: Without dead ends: 4016 [2019-10-22 09:02:59,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2019-10-22 09:02:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3763. [2019-10-22 09:02:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-10-22 09:02:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9725 transitions. [2019-10-22 09:02:59,209 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9725 transitions. Word has length 72 [2019-10-22 09:02:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:59,211 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 9725 transitions. [2019-10-22 09:02:59,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9725 transitions. [2019-10-22 09:02:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:02:59,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:59,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,223 INFO L82 PathProgramCache]: Analyzing trace with hash -319525961, now seen corresponding path program 1 times [2019-10-22 09:02:59,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004468239] [2019-10-22 09:02:59,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:59,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004468239] [2019-10-22 09:02:59,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:59,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:02:59,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307226547] [2019-10-22 09:02:59,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:02:59,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:59,374 INFO L87 Difference]: Start difference. First operand 3763 states and 9725 transitions. Second operand 6 states. [2019-10-22 09:02:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,855 INFO L93 Difference]: Finished difference Result 4117 states and 10347 transitions. [2019-10-22 09:02:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:02:59,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-22 09:02:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:59,863 INFO L225 Difference]: With dead ends: 4117 [2019-10-22 09:02:59,863 INFO L226 Difference]: Without dead ends: 4117 [2019-10-22 09:02:59,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:02:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-10-22 09:02:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3941. [2019-10-22 09:02:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-10-22 09:02:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10065 transitions. [2019-10-22 09:02:59,945 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10065 transitions. Word has length 78 [2019-10-22 09:02:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:59,947 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 10065 transitions. [2019-10-22 09:02:59,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:02:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10065 transitions. [2019-10-22 09:02:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:02:59,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:59,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,954 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash 943870249, now seen corresponding path program 1 times [2019-10-22 09:02:59,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365097852] [2019-10-22 09:02:59,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:00,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365097852] [2019-10-22 09:03:00,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 09:03:00,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790822979] [2019-10-22 09:03:00,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 09:03:00,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:03:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:03:00,950 INFO L87 Difference]: Start difference. First operand 3941 states and 10065 transitions. Second operand 18 states. [2019-10-22 09:03:01,530 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-22 09:03:01,706 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-22 09:03:01,868 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-22 09:03:02,054 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 09:03:02,241 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-22 09:03:02,422 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 09:03:02,614 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 09:03:02,887 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-22 09:03:03,120 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-22 09:03:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:03,386 INFO L93 Difference]: Finished difference Result 10479 states and 26400 transitions. [2019-10-22 09:03:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 09:03:03,387 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-22 09:03:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:03,405 INFO L225 Difference]: With dead ends: 10479 [2019-10-22 09:03:03,405 INFO L226 Difference]: Without dead ends: 10479 [2019-10-22 09:03:03,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-22 09:03:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10479 states. [2019-10-22 09:03:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10479 to 4383. [2019-10-22 09:03:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-10-22 09:03:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 11279 transitions. [2019-10-22 09:03:03,532 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 11279 transitions. Word has length 80 [2019-10-22 09:03:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:03,532 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 11279 transitions. [2019-10-22 09:03:03,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 09:03:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 11279 transitions. [2019-10-22 09:03:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:03,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:03,539 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,540 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 870574188, now seen corresponding path program 1 times [2019-10-22 09:03:03,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345473105] [2019-10-22 09:03:03,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345473105] [2019-10-22 09:03:03,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:03:03,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787245064] [2019-10-22 09:03:03,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:03:03,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:03:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:03,791 INFO L87 Difference]: Start difference. First operand 4383 states and 11279 transitions. Second operand 8 states. [2019-10-22 09:03:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:04,226 INFO L93 Difference]: Finished difference Result 4590 states and 11672 transitions. [2019-10-22 09:03:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:03:04,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-10-22 09:03:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:04,233 INFO L225 Difference]: With dead ends: 4590 [2019-10-22 09:03:04,234 INFO L226 Difference]: Without dead ends: 4590 [2019-10-22 09:03:04,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2019-10-22 09:03:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 4560. [2019-10-22 09:03:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4560 states. [2019-10-22 09:03:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 11614 transitions. [2019-10-22 09:03:04,317 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 11614 transitions. Word has length 80 [2019-10-22 09:03:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:04,317 INFO L462 AbstractCegarLoop]: Abstraction has 4560 states and 11614 transitions. [2019-10-22 09:03:04,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:03:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 11614 transitions. [2019-10-22 09:03:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:04,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:04,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:04,330 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1853473240, now seen corresponding path program 2 times [2019-10-22 09:03:04,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:04,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051698380] [2019-10-22 09:03:04,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051698380] [2019-10-22 09:03:04,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:04,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-22 09:03:04,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581954999] [2019-10-22 09:03:04,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 09:03:04,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 09:03:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:03:04,990 INFO L87 Difference]: Start difference. First operand 4560 states and 11614 transitions. Second operand 17 states. [2019-10-22 09:03:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:06,695 INFO L93 Difference]: Finished difference Result 4437 states and 11357 transitions. [2019-10-22 09:03:06,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 09:03:06,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-10-22 09:03:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,701 INFO L225 Difference]: With dead ends: 4437 [2019-10-22 09:03:06,702 INFO L226 Difference]: Without dead ends: 4437 [2019-10-22 09:03:06,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 09:03:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2019-10-22 09:03:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4286. [2019-10-22 09:03:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-10-22 09:03:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 11076 transitions. [2019-10-22 09:03:06,774 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 11076 transitions. Word has length 80 [2019-10-22 09:03:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,774 INFO L462 AbstractCegarLoop]: Abstraction has 4286 states and 11076 transitions. [2019-10-22 09:03:06,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 09:03:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 11076 transitions. [2019-10-22 09:03:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:06,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:06,781 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1666017527, now seen corresponding path program 2 times [2019-10-22 09:03:06,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315902977] [2019-10-22 09:03:06,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,547 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-10-22 09:03:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:07,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315902977] [2019-10-22 09:03:07,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:07,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 09:03:07,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033976028] [2019-10-22 09:03:07,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 09:03:07,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:03:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:03:07,673 INFO L87 Difference]: Start difference. First operand 4286 states and 11076 transitions. Second operand 18 states. [2019-10-22 09:03:08,607 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 09:03:08,809 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-22 09:03:09,020 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 09:03:09,298 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 09:03:09,528 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-22 09:03:09,776 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-22 09:03:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,038 INFO L93 Difference]: Finished difference Result 12442 states and 31238 transitions. [2019-10-22 09:03:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 09:03:10,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-22 09:03:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,052 INFO L225 Difference]: With dead ends: 12442 [2019-10-22 09:03:10,052 INFO L226 Difference]: Without dead ends: 12442 [2019-10-22 09:03:10,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-22 09:03:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12442 states. [2019-10-22 09:03:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12442 to 4299. [2019-10-22 09:03:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-10-22 09:03:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 11114 transitions. [2019-10-22 09:03:10,175 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 11114 transitions. Word has length 80 [2019-10-22 09:03:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,175 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 11114 transitions. [2019-10-22 09:03:10,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 09:03:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 11114 transitions. [2019-10-22 09:03:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:10,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash 852264605, now seen corresponding path program 3 times [2019-10-22 09:03:10,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819171080] [2019-10-22 09:03:10,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:11,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819171080] [2019-10-22 09:03:11,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 09:03:11,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090563684] [2019-10-22 09:03:11,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 09:03:11,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:03:11,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:03:11,024 INFO L87 Difference]: Start difference. First operand 4299 states and 11114 transitions. Second operand 18 states. [2019-10-22 09:03:11,870 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 09:03:12,040 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-22 09:03:12,205 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 09:03:12,402 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 09:03:12,621 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-22 09:03:12,860 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-22 09:03:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:13,027 INFO L93 Difference]: Finished difference Result 11328 states and 28210 transitions. [2019-10-22 09:03:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 09:03:13,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-22 09:03:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:13,037 INFO L225 Difference]: With dead ends: 11328 [2019-10-22 09:03:13,037 INFO L226 Difference]: Without dead ends: 11328 [2019-10-22 09:03:13,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-22 09:03:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11328 states. [2019-10-22 09:03:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11328 to 4394. [2019-10-22 09:03:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4394 states. [2019-10-22 09:03:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 11306 transitions. [2019-10-22 09:03:13,146 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 11306 transitions. Word has length 80 [2019-10-22 09:03:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:13,146 INFO L462 AbstractCegarLoop]: Abstraction has 4394 states and 11306 transitions. [2019-10-22 09:03:13,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 09:03:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 11306 transitions. [2019-10-22 09:03:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:13,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:13,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:13,152 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1799923137, now seen corresponding path program 4 times [2019-10-22 09:03:13,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:13,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436278528] [2019-10-22 09:03:13,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:13,261 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:13,261 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:03:13,330 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:03:13,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:13 BasicIcfg [2019-10-22 09:03:13,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:13,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:13,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:13,332 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:13,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:54" (3/4) ... [2019-10-22 09:03:13,334 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:03:13,420 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae2afa9c-8bc7-4ed6-bd9b-0932e806f0e7/bin/uautomizer/witness.graphml [2019-10-22 09:03:13,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:13,421 INFO L168 Benchmark]: Toolchain (without parser) took 21094.54 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 571.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 386.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,422 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:13,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1157.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -66.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,422 INFO L168 Benchmark]: Boogie Preprocessor took 61.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:13,423 INFO L168 Benchmark]: RCFGBuilder took 882.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.6 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,423 INFO L168 Benchmark]: TraceAbstraction took 18822.26 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 429.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 232.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,423 INFO L168 Benchmark]: Witness Printer took 88.80 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:13,425 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1157.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -66.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 882.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 945.6 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18822.26 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 429.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 232.4 MB. Max. memory is 11.5 GB. * Witness Printer took 88.80 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; VAL [t1={1:0}, t2={-3:0}] [L1731] 0 return 0; VAL [t1={1:0}, t2={-3:0}] [L1737] 0 int ret = my_drv_init(); VAL [t1={1:0}, t2={-3:0}] [L1738] COND TRUE 0 ret==0 VAL [t1={1:0}, t2={-3:0}] [L1739] 0 int probe_ret; VAL [t1={1:0}, t2={-3:0}] [L1740] 0 struct my_data data; VAL [t1={1:0}, t2={-3:0}] [L1706] 0 struct device *d = &data->dev; VAL [t1={1:0}, t2={-3:0}] [L1708] 0 data->shared.a = 0 VAL [t1={1:0}, t2={-3:0}] [L1709] 0 data->shared.b = 0 VAL [t1={1:0}, t2={-3:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [t1={1:0}, t2={-3:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [t1={1:0}, t2={-3:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={-2:24}, t1={1:0}, t2={-3:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={-2:24}, t1={1:0}, t2={-3:0}] [L1696] 2 struct device *dev = (struct device*)arg; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1697] 2 struct my_data *data; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1696] 1 struct device *dev = (struct device*)arg; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1715] 0 return 0; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1697] 1 struct my_data *data; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1741] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1742] COND TRUE 0 probe_ret==0 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1721] 0 void *status; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1722] 0 \read(t1) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1700] 1 data->shared.a = 1 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1701] EXPR 1 data->shared.b VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, data->shared.b=0, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1701] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, data->shared.b=0, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1703] 1 return 0; VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1723] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, pthread_mutex_lock (&data->lock)=0, t1={1:0}, t2={-3:0}] [L1724] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, pthread_mutex_lock (&data->lock)=0, t1={1:0}, t2={-3:0}] [L1700] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1725] 0 data->shared.a VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1682] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 161 locations, 6 error locations. Result: UNSAFE, OverallTime: 18.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2646 SDtfs, 8659 SDslu, 10388 SDs, 0 SdLazy, 2684 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9536occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 24525 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 284623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...