/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:24:15,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:24:15,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:24:15,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:24:15,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:24:15,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:24:15,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:24:15,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:24:15,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:24:15,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:24:15,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:24:15,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:24:15,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:24:15,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:24:15,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:24:15,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:24:15,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:24:15,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:24:15,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:24:15,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:24:15,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:24:15,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:24:15,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:24:15,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:24:15,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:24:15,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:24:15,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:24:15,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:24:15,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:24:15,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:24:15,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:24:15,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:24:15,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:24:15,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:24:15,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:24:15,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:24:15,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:24:15,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:24:15,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:24:15,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:24:15,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:24:15,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:24:15,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:24:15,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:24:15,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:24:15,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:24:15,469 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:24:15,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:24:15,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:24:15,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:24:15,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:24:15,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:24:15,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:24:15,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:24:15,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:24:15,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:24:15,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:24:15,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:24:15,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:24:15,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:24:15,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:24:15,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:24:15,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:24:15,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:24:15,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:24:15,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:24:15,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:24:15,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:24:15,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:24:15,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:24:15,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:24:15,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:24:15,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:24:15,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:24:15,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:24:15,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:24:15,779 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:24:15,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2019-12-27 00:24:15,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0accb3/d52396cde62a45d3891edf26d737cbbe/FLAG08eadf8d7 [2019-12-27 00:24:16,473 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:24:16,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2019-12-27 00:24:16,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0accb3/d52396cde62a45d3891edf26d737cbbe/FLAG08eadf8d7 [2019-12-27 00:24:16,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0accb3/d52396cde62a45d3891edf26d737cbbe [2019-12-27 00:24:16,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:24:16,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:24:16,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:24:16,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:24:16,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:24:16,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:24:16" (1/1) ... [2019-12-27 00:24:16,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2840a5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:16, skipping insertion in model container [2019-12-27 00:24:16,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:24:16" (1/1) ... [2019-12-27 00:24:16,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:24:16,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:24:17,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:24:17,595 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:24:17,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:24:18,192 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:24:18,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18 WrapperNode [2019-12-27 00:24:18,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:24:18,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:24:18,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:24:18,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:24:18,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:24:18,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:24:18,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:24:18,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:24:18,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... [2019-12-27 00:24:18,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:24:18,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:24:18,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:24:18,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:24:18,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-27 00:24:18,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:24:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:24:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 00:24:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 00:24:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:24:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:24:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-27 00:24:18,404 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-27 00:24:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:24:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:24:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:24:18,408 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:24:19,228 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:24:19,228 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-27 00:24:19,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:24:19 BoogieIcfgContainer [2019-12-27 00:24:19,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:24:19,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:24:19,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:24:19,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:24:19,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:24:16" (1/3) ... [2019-12-27 00:24:19,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0846c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:24:19, skipping insertion in model container [2019-12-27 00:24:19,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:24:18" (2/3) ... [2019-12-27 00:24:19,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0846c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:24:19, skipping insertion in model container [2019-12-27 00:24:19,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:24:19" (3/3) ... [2019-12-27 00:24:19,239 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2019-12-27 00:24:19,250 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:24:19,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:24:19,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-27 00:24:19,259 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:24:19,292 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,292 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,293 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,293 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,294 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,295 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,295 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,295 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,295 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,296 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,296 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,296 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,296 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,297 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,297 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,297 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,297 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,298 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,298 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,298 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,299 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,299 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,299 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,299 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,300 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,300 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,300 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,300 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,301 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,301 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,301 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,302 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,302 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,302 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,302 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,303 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,303 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,303 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,303 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,304 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,304 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,304 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,304 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,305 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,306 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,306 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,307 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,307 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,308 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,308 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,308 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,308 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,308 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,309 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,309 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,309 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,310 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,310 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,314 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,314 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,315 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,315 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,315 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,315 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,315 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,316 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,316 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,317 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,324 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,324 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,325 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,325 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,325 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,325 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,326 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,326 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,326 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,326 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,327 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:24:19,356 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:24:19,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:24:19,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:24:19,376 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:24:19,376 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:24:19,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:24:19,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:24:19,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:24:19,377 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:24:19,393 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 157 transitions [2019-12-27 00:24:19,396 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-27 00:24:19,526 INFO L132 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-27 00:24:19,526 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:24:19,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 513 event pairs. 0/191 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2019-12-27 00:24:19,547 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions [2019-12-27 00:24:19,598 INFO L132 PetriNetUnfolder]: 13/215 cut-off events. [2019-12-27 00:24:19,599 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 00:24:19,602 INFO L76 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 215 events. 13/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 513 event pairs. 0/191 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2019-12-27 00:24:19,609 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4004 [2019-12-27 00:24:19,611 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:24:20,746 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:20,789 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:20,819 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,819 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:20,843 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:20,895 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:20,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:20,928 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:22,966 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:23,028 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:23,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,071 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:23,088 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:23,140 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:23,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:23,176 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:25,778 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:25,814 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:25,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,846 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:25,861 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:25,916 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:25,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:25,955 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:29,092 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:29,130 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:29,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,159 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:29,171 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:29,215 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:29,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:29,253 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:31,283 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:31,340 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:31,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,370 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:31,381 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:31,417 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:31,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:31,447 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:34,600 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:34,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:34,666 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:34,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:34,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:34,718 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:92 [2019-12-27 00:24:34,979 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:35,045 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:35,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,087 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2019-12-27 00:24:35,109 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:35,177 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:35,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:35,224 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2019-12-27 00:24:37,244 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:37,287 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:37,319 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,319 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:37,344 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:37,380 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:37,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:37,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:39,475 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:39,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:39,510 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:39,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:39,534 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:39,534 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-27 00:24:39,935 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-27 00:24:40,508 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:40,546 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:40,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,575 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:24:40,588 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:40,624 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:40,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:40,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:42,672 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:42,710 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:42,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,742 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:42,761 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:42,809 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:42,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:42,843 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:24:44,883 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:44,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:44,954 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:44,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:44,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:44,981 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:44,993 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:45,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:45,032 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:45,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:45,064 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:45,064 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:24:47,244 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 00:24:47,366 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 00:24:47,377 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:47,414 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:47,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,442 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:47,464 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:47,502 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:47,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:47,554 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:49,571 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:49,682 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 00:24:49,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:49,688 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:49,807 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 00:24:49,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:49,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:49,810 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:152, output treesize:154 [2019-12-27 00:24:49,830 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:49,934 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 00:24:49,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:49,940 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:50,069 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 00:24:50,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:50,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:50,071 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:152, output treesize:154 [2019-12-27 00:24:52,163 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:52,224 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:52,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,255 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:52,268 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:52,308 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:52,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:52,341 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:54,583 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,622 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-27 00:24:54,664 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,702 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:54,733 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:54,734 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-27 00:24:56,752 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:56,789 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:56,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,821 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:56,858 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:56,904 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:56,939 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:56,939 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:59,280 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,318 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,344 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:24:59,355 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,394 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:24:59,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:24:59,427 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-27 00:25:01,586 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-27 00:25:02,098 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 00:25:02,114 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:02,330 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-27 00:25:02,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:02,337 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:02,562 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 00:25:02,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:02,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:02,564 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:184, output treesize:196 [2019-12-27 00:25:02,771 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 00:25:02,951 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 00:25:03,095 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 00:25:03,124 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,236 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 00:25:03,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,242 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,344 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-27 00:25:03,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,346 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:155, output treesize:157 [2019-12-27 00:25:03,360 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,478 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 00:25:03,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,485 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,593 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-27 00:25:03,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:25:03,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:25:03,595 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:155, output treesize:157 [2019-12-27 00:25:05,966 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-27 00:25:06,568 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-12-27 00:25:06,859 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-27 00:25:07,831 WARN L192 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-12-27 00:25:08,331 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-27 00:25:08,345 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7312 [2019-12-27 00:25:08,345 INFO L214 etLargeBlockEncoding]: Total number of compositions: 155 [2019-12-27 00:25:08,348 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 45 transitions [2019-12-27 00:25:08,385 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 682 states. [2019-12-27 00:25:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states. [2019-12-27 00:25:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:25:08,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:08,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:25:08,395 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 17094137, now seen corresponding path program 1 times [2019-12-27 00:25:08,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:08,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202525927] [2019-12-27 00:25:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:08,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202525927] [2019-12-27 00:25:08,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:08,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:08,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121297483] [2019-12-27 00:25:08,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:08,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:08,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:08,854 INFO L87 Difference]: Start difference. First operand 682 states. Second operand 3 states. [2019-12-27 00:25:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:08,963 INFO L93 Difference]: Finished difference Result 675 states and 1701 transitions. [2019-12-27 00:25:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:08,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:25:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:08,999 INFO L225 Difference]: With dead ends: 675 [2019-12-27 00:25:08,999 INFO L226 Difference]: Without dead ends: 601 [2019-12-27 00:25:09,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-12-27 00:25:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-12-27 00:25:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-27 00:25:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1507 transitions. [2019-12-27 00:25:09,099 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1507 transitions. Word has length 4 [2019-12-27 00:25:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1507 transitions. [2019-12-27 00:25:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1507 transitions. [2019-12-27 00:25:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 00:25:09,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:09,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 00:25:09,100 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash 17041117, now seen corresponding path program 1 times [2019-12-27 00:25:09,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:09,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123554793] [2019-12-27 00:25:09,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:09,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123554793] [2019-12-27 00:25:09,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:09,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177717029] [2019-12-27 00:25:09,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:09,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:09,261 INFO L87 Difference]: Start difference. First operand 601 states and 1507 transitions. Second operand 3 states. [2019-12-27 00:25:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:09,396 INFO L93 Difference]: Finished difference Result 756 states and 1882 transitions. [2019-12-27 00:25:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 00:25:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:09,405 INFO L225 Difference]: With dead ends: 756 [2019-12-27 00:25:09,405 INFO L226 Difference]: Without dead ends: 756 [2019-12-27 00:25:09,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-12-27 00:25:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 660. [2019-12-27 00:25:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-12-27 00:25:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1662 transitions. [2019-12-27 00:25:09,451 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1662 transitions. Word has length 4 [2019-12-27 00:25:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:09,452 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 1662 transitions. [2019-12-27 00:25:09,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1662 transitions. [2019-12-27 00:25:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 00:25:09,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:09,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 00:25:09,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash -803609362, now seen corresponding path program 1 times [2019-12-27 00:25:09,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:09,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887351265] [2019-12-27 00:25:09,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:09,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887351265] [2019-12-27 00:25:09,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:09,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:25:09,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073087086] [2019-12-27 00:25:09,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:25:09,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:25:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:25:09,526 INFO L87 Difference]: Start difference. First operand 660 states and 1662 transitions. Second operand 4 states. [2019-12-27 00:25:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:09,731 INFO L93 Difference]: Finished difference Result 817 states and 2007 transitions. [2019-12-27 00:25:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:25:09,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-27 00:25:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:09,737 INFO L225 Difference]: With dead ends: 817 [2019-12-27 00:25:09,737 INFO L226 Difference]: Without dead ends: 730 [2019-12-27 00:25:09,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:25:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-27 00:25:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 698. [2019-12-27 00:25:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-12-27 00:25:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1771 transitions. [2019-12-27 00:25:09,760 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1771 transitions. Word has length 6 [2019-12-27 00:25:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:09,760 INFO L462 AbstractCegarLoop]: Abstraction has 698 states and 1771 transitions. [2019-12-27 00:25:09,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:25:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1771 transitions. [2019-12-27 00:25:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 00:25:09,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:09,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:09,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash -675936352, now seen corresponding path program 1 times [2019-12-27 00:25:09,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:09,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029535076] [2019-12-27 00:25:09,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:09,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029535076] [2019-12-27 00:25:09,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:09,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:09,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727097891] [2019-12-27 00:25:09,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:09,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:09,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:09,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:09,869 INFO L87 Difference]: Start difference. First operand 698 states and 1771 transitions. Second operand 3 states. [2019-12-27 00:25:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:10,016 INFO L93 Difference]: Finished difference Result 898 states and 2265 transitions. [2019-12-27 00:25:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:10,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 00:25:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:10,023 INFO L225 Difference]: With dead ends: 898 [2019-12-27 00:25:10,023 INFO L226 Difference]: Without dead ends: 898 [2019-12-27 00:25:10,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-12-27 00:25:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 758. [2019-12-27 00:25:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 00:25:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1927 transitions. [2019-12-27 00:25:10,049 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1927 transitions. Word has length 8 [2019-12-27 00:25:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:10,050 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1927 transitions. [2019-12-27 00:25:10,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1927 transitions. [2019-12-27 00:25:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:25:10,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:10,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:10,053 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 520808996, now seen corresponding path program 1 times [2019-12-27 00:25:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484541552] [2019-12-27 00:25:10,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:25:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:25:10,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484541552] [2019-12-27 00:25:10,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:25:10,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:25:10,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630567583] [2019-12-27 00:25:10,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:25:10,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:25:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:25:10,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:10,119 INFO L87 Difference]: Start difference. First operand 758 states and 1927 transitions. Second operand 3 states. [2019-12-27 00:25:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:25:10,257 INFO L93 Difference]: Finished difference Result 926 states and 2337 transitions. [2019-12-27 00:25:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:25:10,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 00:25:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:25:10,264 INFO L225 Difference]: With dead ends: 926 [2019-12-27 00:25:10,264 INFO L226 Difference]: Without dead ends: 926 [2019-12-27 00:25:10,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:25:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-12-27 00:25:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 818. [2019-12-27 00:25:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-27 00:25:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2115 transitions. [2019-12-27 00:25:10,293 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2115 transitions. Word has length 9 [2019-12-27 00:25:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:25:10,293 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 2115 transitions. [2019-12-27 00:25:10,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:25:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2115 transitions. [2019-12-27 00:25:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:25:10,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:25:10,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:25:10,296 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:25:10,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:25:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -440644709, now seen corresponding path program 1 times [2019-12-27 00:25:10,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:25:10,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069707291] [2019-12-27 00:25:10,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:25:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:25:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:25:10,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:25:10,450 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:25:10,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [527] [527] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse7 (store |v_#valid_106| 0 0))) (let ((.cse0 (store .cse7 |v_~#t1~0.base_36| 1))) (let ((.cse4 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 28)) (.cse1 (store .cse0 |v_~#t2~0.base_14| 1)) (.cse3 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_18 24))) (and (< |v_#StackHeapBarrier_38| |v_~#t2~0.base_14|) (= (select .cse0 |v_~#t2~0.base_14|) 0) (= |v_#NULL.offset_7| 0) (= 0 |v_ULTIMATE.start_main_~#data~1.offset_121|) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#data~1.base_124|)) (= v_ULTIMATE.start_my_drv_probe_~d~0.base_17 v_ULTIMATE.start_my_drv_probe_~data.base_18) (= |v_~#t2~0.offset_14| 0) (= 0 (select (select |v_#memory_int_396| |v_~#t2~0.base_14|) |v_~#t2~0.offset_14|)) (= |v_~#t1~0.offset_36| 0) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_13| v_ULTIMATE.start_my_drv_probe_~data.base_18) (= (store |v_#pthreadsMutex_132| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (select |v_#pthreadsMutex_132| v_ULTIMATE.start_my_drv_probe_~data.base_18) v_ULTIMATE.start_my_drv_probe_~data.offset_18 0)) |v_#pthreadsMutex_131|) (= |v_#memory_int_395| (let ((.cse2 (store |v_#memory_int_396| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_int_396| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse3 0) .cse4 0)))) (store .cse2 |v_~#t1~0.base_36| (store (select .cse2 |v_~#t1~0.base_36|) |v_~#t1~0.offset_36| 0)))) (= 0 (select (select |v_#memory_int_396| |v_~#t1~0.base_36|) |v_~#t1~0.offset_36|)) (= |v_#memory_$Pointer$.offset_350| (let ((.cse5 (store |v_#memory_$Pointer$.offset_351| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.offset_351| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse3 v_DerPreprocessor_93) .cse4 v_DerPreprocessor_94)))) (store .cse5 |v_~#t1~0.base_36| (store (select .cse5 |v_~#t1~0.base_36|) |v_~#t1~0.offset_36| (select (select |v_#memory_$Pointer$.offset_350| |v_~#t1~0.base_36|) |v_~#t1~0.offset_36|))))) (= v_ULTIMATE.start_my_drv_probe_~res~0_21 0) (= (let ((.cse6 (store |v_#memory_$Pointer$.base_351| v_ULTIMATE.start_my_drv_probe_~data.base_18 (store (store (select |v_#memory_$Pointer$.base_351| v_ULTIMATE.start_my_drv_probe_~data.base_18) .cse3 v_DerPreprocessor_92) .cse4 v_DerPreprocessor_91)))) (store .cse6 |v_~#t1~0.base_36| (store (select .cse6 |v_~#t1~0.base_36|) |v_~#t1~0.offset_36| (select (select |v_#memory_$Pointer$.base_350| |v_~#t1~0.base_36|) |v_~#t1~0.offset_36|)))) |v_#memory_$Pointer$.base_350|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_13| |v_ULTIMATE.start_main_~#data~1.base_124|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#data~1.base_124|) (= (select .cse7 |v_~#t1~0.base_36|) 0) (= |v_#valid_104| (store .cse1 |v_ULTIMATE.start_main_~#data~1.base_124| 1)) (= |v_#length_71| (store (store (store |v_#length_73| |v_~#t1~0.base_36| 4) |v_~#t2~0.base_14| 4) |v_ULTIMATE.start_main_~#data~1.base_124| 32)) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_13| |v_ULTIMATE.start_main_~#data~1.offset_121|) (= 0 |v_#NULL.base_7|) (= 0 v_ULTIMATE.start_main_~ret~0_25) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_13| v_ULTIMATE.start_my_drv_probe_~data.offset_18) (< |v_#StackHeapBarrier_38| |v_~#t1~0.base_36|) (< 0 |v_#StackHeapBarrier_38|) (= v_ULTIMATE.start_my_drv_probe_~d~0.offset_17 .cse3) (= 0 |v_ULTIMATE.start_my_drv_init_#res_15|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_132|, #StackHeapBarrier=|v_#StackHeapBarrier_38|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_351|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_396|, #length=|v_#length_73|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_351|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_34|, ULTIMATE.start_main_#t~mem46=|v_ULTIMATE.start_main_#t~mem46_36|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_31|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_28|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_350|, ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_20|, #NULL.offset=|v_#NULL.offset_7|, ~#t1~0.offset=|v_~#t1~0.offset_36|, ~#t1~0.base=|v_~#t1~0.base_36|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_18, ULTIMATE.start_my_drv_init_#res=|v_ULTIMATE.start_my_drv_init_#res_15|, ~#t2~0.offset=|v_~#t2~0.offset_14|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_121|, #length=|v_#length_71|, ~#t2~0.base=|v_~#t2~0.base_14|, #pthreadsMutex=|v_#pthreadsMutex_131|, ULTIMATE.start_my_drv_probe_#in~data.base=|v_ULTIMATE.start_my_drv_probe_#in~data.base_13|, ULTIMATE.start_my_drv_probe_~d~0.offset=v_ULTIMATE.start_my_drv_probe_~d~0.offset_17, ULTIMATE.start_main_~ret~0=v_ULTIMATE.start_main_~ret~0_25, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_18, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_28|, ULTIMATE.start_my_drv_probe_#in~data.offset=|v_ULTIMATE.start_my_drv_probe_#in~data.offset_13|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_52|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_10|, ULTIMATE.start_my_drv_probe_#t~nondet32=|v_ULTIMATE.start_my_drv_probe_#t~nondet32_24|, ULTIMATE.start_my_drv_probe_~res~0=v_ULTIMATE.start_my_drv_probe_~res~0_21, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_11|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_my_drv_probe_~d~0.base=v_ULTIMATE.start_my_drv_probe_~d~0.base_17, #StackHeapBarrier=|v_#StackHeapBarrier_38|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_395|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_41, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_124|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_350|} AuxVars[v_DerPreprocessor_93, v_DerPreprocessor_94, v_DerPreprocessor_91, v_DerPreprocessor_92] AssignedVars[ULTIMATE.start_main_#t~mem45, ULTIMATE.start_main_#t~mem46, ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem44, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, #NULL.offset, ~#t1~0.offset, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_~#data~1.offset, #length, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, ULTIMATE.start_my_drv_probe_~d~0.offset, ULTIMATE.start_main_~ret~0, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_probe_#in~data.offset, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_probe_#t~nondet33, ULTIMATE.start_my_drv_probe_#t~nondet32, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet34, #NULL.base, ULTIMATE.start_my_drv_probe_~d~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:10,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [500] [500] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_110| v_my_callbackThread1of1ForFork0_~data~0.base_84))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.base_10 v_my_callbackThread1of1ForFork0_~arg.base_6) (= v_my_callbackThread1of1ForFork0_~arg.offset_6 v_my_callbackThread1of1ForFork0_~dev~0.offset_10) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_5| v_my_callbackThread1of1ForFork0_~arg.base_6) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_10 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_14) (= |v_my_callbackThread1of1ForFork0_#t~nondet30_30| 0) (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| v_my_callbackThread1of1ForFork0_~data~0.base_84 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_84 1))) (= v_my_callbackThread1of1ForFork0_~dev~0.base_10 v_my_callbackThread1of1ForFork0_~__mptr~0.base_14) (= v_my_callbackThread1of1ForFork0_~data~0.offset_84 (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_14 (- 24))) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_84) 0) (= v_my_callbackThread1of1ForFork0_~data~0.base_84 v_my_callbackThread1of1ForFork0_~__mptr~0.base_14) (= v_my_callbackThread1of1ForFork0_~arg.offset_6 |v_my_callbackThread1of1ForFork0_#in~arg.offset_5|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_5|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_84, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_5|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_6, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_6, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_5|, my_callbackThread1of1ForFork0_#t~nondet30=|v_my_callbackThread1of1ForFork0_#t~nondet30_30|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_14, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_14, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_10, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_84, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_10} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, my_callbackThread1of1ForFork0_#t~nondet30, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset] because there is no mapped edge [2019-12-27 00:25:10,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1713-2-->L1714-1: Formula: (and (= (store |v_#memory_int_88| |v_~#t2~0.base_6| (store (select |v_#memory_int_88| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| 1)) |v_#memory_int_87|) (= |v_#memory_$Pointer$.base_73| (store |v_#memory_$Pointer$.base_74| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.base_74| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.base_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|)))) (= (store |v_#memory_$Pointer$.offset_74| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.offset_74| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.offset_73| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.offset_73|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_74|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_88|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_74|, ~#t2~0.base=|v_~#t2~0.base_6|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_73|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_73|, ~#t2~0.base=|v_~#t2~0.base_6|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet33, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:10,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1714-2-->L1741-3: Formula: (and (= |v_ULTIMATE.start_my_drv_probe_#res_13| 0) (= |v_ULTIMATE.start_my_drv_probe_#res_13| |v_ULTIMATE.start_main_#t~ret42_22|)) InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_13|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_22|, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_6|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_probe_#t~nondet34] because there is no mapped edge [2019-12-27 00:25:10,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [514] [514] L1741-3-->L1722: Formula: (let ((.cse0 (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_43 24))) (and (= |v_#length_36| (store |v_#length_37| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24| 4)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_10| |v_ULTIMATE.start_main_~#data~1.base_103|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_10| |v_ULTIMATE.start_main_~#data~1.offset_100|) (= |v_ULTIMATE.start_main_#t~ret42_25| v_ULTIMATE.start_main_~probe_ret~0_23) (= 0 v_ULTIMATE.start_main_~probe_ret~0_23) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.base_10| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) (= (store |v_#memory_$Pointer$.base_268| v_ULTIMATE.start_my_drv_disconnect_~data.base_43 (store (select |v_#memory_$Pointer$.base_268| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) .cse0 (select (select |v_#memory_$Pointer$.base_267| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) .cse0))) |v_#memory_$Pointer$.base_267|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24|) (= |v_#memory_int_308| (store |v_#memory_int_309| v_ULTIMATE.start_my_drv_disconnect_~data.base_43 (store (select |v_#memory_int_309| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) .cse0 3))) (= |v_#memory_$Pointer$.offset_267| (store |v_#memory_$Pointer$.offset_268| v_ULTIMATE.start_my_drv_disconnect_~data.base_43 (store (select |v_#memory_$Pointer$.offset_268| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) .cse0 (select (select |v_#memory_$Pointer$.offset_267| v_ULTIMATE.start_my_drv_disconnect_~data.base_43) .cse0)))) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_10| v_ULTIMATE.start_my_drv_disconnect_~data.offset_43) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_19| 0) (= |v_#valid_63| (store |v_#valid_64| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24| 1)) (= 0 (select |v_#valid_64| |v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_268|, #valid=|v_#valid_64|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_25|, #memory_int=|v_#memory_int_309|, #length=|v_#length_37|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_100|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_103|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_268|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_43, ULTIMATE.start_my_drv_disconnect_#t~mem37=|v_ULTIMATE.start_my_drv_disconnect_#t~mem37_34|, ULTIMATE.start_my_drv_disconnect_#in~data.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data.offset_10|, ULTIMATE.start_my_drv_disconnect_#t~mem39=|v_ULTIMATE.start_my_drv_disconnect_#t~mem39_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_267|, ULTIMATE.start_my_drv_disconnect_#t~mem36=|v_ULTIMATE.start_my_drv_disconnect_#t~mem36_29|, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_29|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_24|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.base_16|, ULTIMATE.start_my_drv_disconnect_#t~nondet38.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet38.offset_14|, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset_16|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.offset_19|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_43, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0.base_24|, #valid=|v_#valid_63|, ULTIMATE.start_my_drv_disconnect_#t~nondet38.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet38.base_14|, #memory_int=|v_#memory_int_308|, #length=|v_#length_36|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_100|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_23, ULTIMATE.start_my_drv_disconnect_#in~data.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data.base_10|, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_103|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_267|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem37, ULTIMATE.start_my_drv_disconnect_#in~data.offset, ULTIMATE.start_my_drv_disconnect_#t~mem39, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~mem36, ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_main_#t~ret42, ULTIMATE.start_my_drv_disconnect_#t~nondet40.base, ULTIMATE.start_my_drv_disconnect_#t~nondet38.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet40.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~data.base, ULTIMATE.start_my_drv_disconnect_~#status~0.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet38.base, #memory_int, #length, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_my_drv_disconnect_#in~data.base, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:10,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [401] [401] L1699-1-->L1700-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_16 24))) (and (= (store |v_#memory_$Pointer$.offset_54| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_$Pointer$.offset_54| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 (select (select |v_#memory_$Pointer$.offset_53| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_int_67| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_int_67| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 1)) |v_#memory_int_66|) (= (store |v_#memory_$Pointer$.base_54| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_$Pointer$.base_54| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 (select (select |v_#memory_$Pointer$.base_53| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0))) |v_#memory_$Pointer$.base_53|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_16, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_54|, #memory_int=|v_#memory_int_67|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_16, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_54|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_16, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_53|, #memory_int=|v_#memory_int_66|, my_callbackThread1of1ForFork0_#t~nondet30=|v_my_callbackThread1of1ForFork0_#t~nondet30_6|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_16, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_53|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet30, #memory_$Pointer$.offset] because there is no mapped edge [2019-12-27 00:25:10,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [489] [489] L1723-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start_ldv_assert_~expression_78 |v_ULTIMATE.start_ldv_assert_#in~expression_54|) (= v_ULTIMATE.start_ldv_assert_~expression_78 0) (not (= 3 |v_ULTIMATE.start_my_drv_disconnect_#t~mem35_21|)) (= (select (select |v_#memory_int_224| v_ULTIMATE.start_my_drv_disconnect_~data.base_35) (+ v_ULTIMATE.start_my_drv_disconnect_~data.offset_35 24)) |v_ULTIMATE.start_my_drv_disconnect_#t~mem35_21|)) InVars {ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_35, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_35, #memory_int=|v_#memory_int_224|} OutVars{ULTIMATE.start_my_drv_disconnect_~data.offset=v_ULTIMATE.start_my_drv_disconnect_~data.offset_35, ULTIMATE.start_my_drv_disconnect_~data.base=v_ULTIMATE.start_my_drv_disconnect_~data.base_35, ULTIMATE.start_my_drv_disconnect_#t~mem35=|v_ULTIMATE.start_my_drv_disconnect_#t~mem35_21|, #memory_int=|v_#memory_int_224|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_54|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_78} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem35, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2019-12-27 00:25:10,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:25:10 BasicIcfg [2019-12-27 00:25:10,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:25:10,490 INFO L168 Benchmark]: Toolchain (without parser) took 53806.96 ms. Allocated memory was 145.2 MB in the beginning and 308.3 MB in the end (delta: 163.1 MB). Free memory was 99.5 MB in the beginning and 184.0 MB in the end (delta: -84.5 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,491 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1512.91 ms. Allocated memory was 145.2 MB in the beginning and 237.0 MB in the end (delta: 91.8 MB). Free memory was 99.3 MB in the beginning and 169.6 MB in the end (delta: -70.3 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.60 ms. Allocated memory is still 237.0 MB. Free memory was 169.6 MB in the beginning and 165.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,503 INFO L168 Benchmark]: Boogie Preprocessor took 46.95 ms. Allocated memory is still 237.0 MB. Free memory was 165.2 MB in the beginning and 162.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,504 INFO L168 Benchmark]: RCFGBuilder took 910.98 ms. Allocated memory is still 237.0 MB. Free memory was 162.3 MB in the beginning and 115.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,504 INFO L168 Benchmark]: TraceAbstraction took 51253.31 ms. Allocated memory was 237.0 MB in the beginning and 308.3 MB in the end (delta: 71.3 MB). Free memory was 113.7 MB in the beginning and 184.0 MB in the end (delta: -70.3 MB). Peak memory consumption was 958.7 kB. Max. memory is 7.1 GB. [2019-12-27 00:25:10,513 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1512.91 ms. Allocated memory was 145.2 MB in the beginning and 237.0 MB in the end (delta: 91.8 MB). Free memory was 99.3 MB in the beginning and 169.6 MB in the end (delta: -70.3 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.60 ms. Allocated memory is still 237.0 MB. Free memory was 169.6 MB in the beginning and 165.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.95 ms. Allocated memory is still 237.0 MB. Free memory was 165.2 MB in the beginning and 162.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 910.98 ms. Allocated memory is still 237.0 MB. Free memory was 162.3 MB in the beginning and 115.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51253.31 ms. Allocated memory was 237.0 MB in the beginning and 308.3 MB in the end (delta: 71.3 MB). Free memory was 113.7 MB in the beginning and 184.0 MB in the end (delta: -70.3 MB). Peak memory consumption was 958.7 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 48.9s, 153 ProgramPointsBefore, 45 ProgramPointsAfterwards, 157 TransitionsBefore, 45 TransitionsAfterwards, 4004 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 22 ConcurrentYvCompositions, 5 ChoiceCompositions, 2117 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 17 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 38.8s, 0 MoverChecksTotal, 7312 CheckedPairsTotal, 155 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, t1={5:0}, t2={7:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, pthread_mutex_lock (&data->lock)=0, t1={5:0}, t2={7:0}] [L1723] 0 data->shared.b = 3 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 6 error locations. Result: UNSAFE, OverallTime: 51.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 196 SDtfs, 57 SDslu, 119 SDs, 0 SdLazy, 191 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 376 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...