/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-4336eb1
[2019-12-27 18:58:25,140 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-12-27 18:58:25,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-12-27 18:58:25,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-12-27 18:58:25,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-12-27 18:58:25,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-12-27 18:58:25,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-12-27 18:58:25,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-12-27 18:58:25,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-12-27 18:58:25,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-12-27 18:58:25,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-12-27 18:58:25,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-12-27 18:58:25,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-12-27 18:58:25,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-12-27 18:58:25,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-12-27 18:58:25,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-12-27 18:58:25,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-12-27 18:58:25,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-12-27 18:58:25,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-12-27 18:58:25,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-12-27 18:58:25,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-12-27 18:58:25,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-12-27 18:58:25,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-12-27 18:58:25,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-12-27 18:58:25,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-12-27 18:58:25,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-12-27 18:58:25,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-12-27 18:58:25,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-12-27 18:58:25,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-12-27 18:58:25,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-12-27 18:58:25,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-12-27 18:58:25,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-12-27 18:58:25,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-12-27 18:58:25,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-12-27 18:58:25,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-12-27 18:58:25,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-12-27 18:58:25,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-12-27 18:58:25,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-12-27 18:58:25,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-12-27 18:58:25,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-12-27 18:58:25,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-12-27 18:58:25,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf
[2019-12-27 18:58:25,248 INFO L113 SettingsManager]: Loading preferences was successful
[2019-12-27 18:58:25,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-12-27 18:58:25,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-12-27 18:58:25,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-12-27 18:58:25,253 INFO L138 SettingsManager]: * Use SBE=true
[2019-12-27 18:58:25,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-12-27 18:58:25,253 INFO L138 SettingsManager]: * sizeof long=4
[2019-12-27 18:58:25,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-12-27 18:58:25,254 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-12-27 18:58:25,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-12-27 18:58:25,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-12-27 18:58:25,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-12-27 18:58:25,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-12-27 18:58:25,255 INFO L138 SettingsManager]: * sizeof long double=12
[2019-12-27 18:58:25,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-12-27 18:58:25,255 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-12-27 18:58:25,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-12-27 18:58:25,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-12-27 18:58:25,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-12-27 18:58:25,256 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-12-27 18:58:25,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-12-27 18:58:25,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-12-27 18:58:25,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-12-27 18:58:25,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-12-27 18:58:25,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-12-27 18:58:25,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-12-27 18:58:25,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-12-27 18:58:25,257 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true
[2019-12-27 18:58:25,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-12-27 18:58:25,258 INFO L138 SettingsManager]: * Interpolant automaton=MCR
[2019-12-27 18:58:25,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2019-12-27 18:58:25,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-12-27 18:58:25,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-12-27 18:58:25,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-12-27 18:58:25,590 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-12-27 18:58:25,591 INFO L275 PluginConnector]: CDTParser initialized
[2019-12-27 18:58:25,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i
[2019-12-27 18:58:25,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f83693/2cd9e1a711584df08c73e265e46ba1cf/FLAG2c4662cb8
[2019-12-27 18:58:26,287 INFO L306 CDTParser]: Found 1 translation units.
[2019-12-27 18:58:26,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i
[2019-12-27 18:58:26,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f83693/2cd9e1a711584df08c73e265e46ba1cf/FLAG2c4662cb8
[2019-12-27 18:58:26,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f83693/2cd9e1a711584df08c73e265e46ba1cf
[2019-12-27 18:58:26,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-12-27 18:58:26,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2019-12-27 18:58:26,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-12-27 18:58:26,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-12-27 18:58:26,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-12-27 18:58:26,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:26" (1/1) ...
[2019-12-27 18:58:26,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e97b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:26, skipping insertion in model container
[2019-12-27 18:58:26,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:26" (1/1) ...
[2019-12-27 18:58:26,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2019-12-27 18:58:26,612 INFO L178 MainTranslator]: Built tables and reachable declarations
[2019-12-27 18:58:27,427 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-12-27 18:58:27,436 INFO L203 MainTranslator]: Completed pre-run
[2019-12-27 18:58:27,526 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-12-27 18:58:28,094 INFO L208 MainTranslator]: Completed translation
[2019-12-27 18:58:28,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28 WrapperNode
[2019-12-27 18:58:28,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-12-27 18:58:28,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-12-27 18:58:28,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-12-27 18:58:28,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-12-27 18:58:28,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-12-27 18:58:28,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-12-27 18:58:28,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-12-27 18:58:28,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-12-27 18:58:28,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (1/1) ...
[2019-12-27 18:58:28,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-12-27 18:58:28,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-12-27 18:58:28,277 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-12-27 18:58:28,277 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-12-27 18:58:28,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (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 18:58:28,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-12-27 18:58:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-12-27 18:58:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2019-12-27 18:58:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2019-12-27 18:58:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-12-27 18:58:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-12-27 18:58:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback
[2019-12-27 18:58:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback
[2019-12-27 18:58:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-12-27 18:58:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-12-27 18:58:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2019-12-27 18:58:28,382 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 18:58:29,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-12-27 18:58:29,282 INFO L287 CfgBuilder]: Removed 24 assume(true) statements.
[2019-12-27 18:58:29,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:29 BoogieIcfgContainer
[2019-12-27 18:58:29,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-12-27 18:58:29,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-12-27 18:58:29,285 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-12-27 18:58:29,289 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-12-27 18:58:29,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:58:26" (1/3) ...
[2019-12-27 18:58:29,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d962713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:29, skipping insertion in model container
[2019-12-27 18:58:29,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:28" (2/3) ...
[2019-12-27 18:58:29,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d962713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:29, skipping insertion in model container
[2019-12-27 18:58:29,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:29" (3/3) ...
[2019-12-27 18:58:29,292 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i
[2019-12-27 18:58:29,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2019-12-27 18:58:29,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-12-27 18:58:29,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations.
[2019-12-27 18:58:29,311 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2019-12-27 18:58:29,342 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,342 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,343 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,343 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,343 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,343 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,343 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,344 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,345 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,345 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,345 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,345 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,346 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,346 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,346 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,347 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,350 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,350 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,351 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,351 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,351 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,356 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,356 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,357 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,357 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,357 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,357 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,358 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,358 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,359 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,359 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,359 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,359 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,360 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,361 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,361 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,361 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,361 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,362 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,366 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,367 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,367 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,367 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,367 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,368 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,369 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,369 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,369 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,369 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,370 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,371 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,371 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,371 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,371 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,375 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,375 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,375 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,376 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,376 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,376 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,376 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,376 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,377 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,377 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,377 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,377 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,386 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,386 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,386 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,387 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,387 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,387 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,388 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,388 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,388 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,388 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,389 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,389 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 18:58:29,420 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2019-12-27 18:58:29,442 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-12-27 18:58:29,442 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-12-27 18:58:29,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-12-27 18:58:29,442 INFO L376 AbstractCegarLoop]: Backedges is MCR
[2019-12-27 18:58:29,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-12-27 18:58:29,443 INFO L378 AbstractCegarLoop]: Difference is false
[2019-12-27 18:58:29,443 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-12-27 18:58:29,443 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-12-27 18:58:29,460 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 157 transitions
[2019-12-27 18:58:29,462 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions
[2019-12-27 18:58:29,553 INFO L132 PetriNetUnfolder]: 11/195 cut-off events.
[2019-12-27 18:58:29,553 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2019-12-27 18:58:29,563 INFO L76 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 195 events. 11/195 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 354 event pairs. 0/175 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place.
[2019-12-27 18:58:29,595 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 157 transitions
[2019-12-27 18:58:29,640 INFO L132 PetriNetUnfolder]: 11/195 cut-off events.
[2019-12-27 18:58:29,640 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2019-12-27 18:58:29,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 195 events. 11/195 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 354 event pairs. 0/175 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place.
[2019-12-27 18:58:29,650 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4004
[2019-12-27 18:58:29,652 INFO L170 etLargeBlockEncoding]: Semantic Check.
[2019-12-27 18:58:30,273 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 18:58:30,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:30,320 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 18:58:30,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:30,358 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 18:58:30,359 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:30,384 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 18:58:30,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:30,430 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 18:58:30,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:30,462 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 18:58:30,462 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:32,484 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 18:58:32,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:32,529 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 18:58:32,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:32,561 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 18:58:32,561 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:32,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 18:58:32,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:32,625 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 18:58:32,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:32,663 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 18:58:32,663 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:35,071 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 18:58:35,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:35,120 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 18:58:35,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:35,153 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 18:58:35,154 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:35,172 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 18:58:35,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:35,214 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 18:58:35,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:35,247 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 18:58:35,248 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:37,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 18:58:37,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:37,896 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 18:58:37,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:37,925 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 18:58:37,926 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:37,949 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 18:58:37,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:37,985 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 18:58:38,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:38,012 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 18:58:38,013 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:40,797 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 18:58:40,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:40,839 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 18:58:40,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:40,870 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 18:58:40,870 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:40,885 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 18:58:40,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:40,924 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 18:58:40,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:40,969 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 18:58:40,970 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:43,004 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 18:58:43,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:43,039 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 18:58:43,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:43,067 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 18:58:43,068 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:43,083 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 18:58:43,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:43,124 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 18:58:43,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:43,154 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 18:58:43,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:45,221 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 18:58:45,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:45,268 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 18:58:45,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:45,296 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 18:58:45,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:45,308 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 18:58:45,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:45,348 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 18:58:45,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:45,383 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 18:58:45,384 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:48,617 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 18:58:48,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:48,679 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 18:58:48,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:48,732 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 18:58:48,732 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:86
[2019-12-27 18:58:49,193 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 18:58:49,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:49,230 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 18:58:49,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:49,256 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 18:58:49,257 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:49,270 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 18:58:49,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:49,310 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 18:58:49,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:49,339 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 18:58:49,339 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:58:51,351 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 18:58:51,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:51,387 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 18:58:51,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:51,419 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 18:58:51,419 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116
[2019-12-27 18:58:51,439 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 18:58:51,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:51,474 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 18:58:51,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:51,505 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 18:58:51,505 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114
[2019-12-27 18:58:53,539 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 18:58:53,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:53,591 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 18:58:53,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:53,631 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 18:58:53,631 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114
[2019-12-27 18:58:53,645 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 18:58:53,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:53,698 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 18:58:53,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:53,730 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 18:58:53,730 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116
[2019-12-27 18:58:56,199 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 18:58:56,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,230 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 18:58:56,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,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 18:58:56,254 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67
[2019-12-27 18:58:56,284 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 18:58:56,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,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 18:58:56,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,390 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 18:58:56,390 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119
[2019-12-27 18:58:56,406 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 18:58:56,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,484 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 18:58:56,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:56,546 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 18:58:56,547 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119
[2019-12-27 18:58:58,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 18:58:58,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:58,868 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 18:58:58,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:58,896 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 18:58:58,896 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114
[2019-12-27 18:58:58,913 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 18:58:58,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:58,966 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 18:58:58,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:58:58,996 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 18:58:58,997 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116
[2019-12-27 18:59:01,063 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 18:59:01,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:01,101 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 18:59:01,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:01,135 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 18:59:01,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:01,148 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 18:59:01,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:01,190 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 18:59:01,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:01,221 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 18:59:01,221 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:03,295 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 18:59:03,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:03,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 18:59:03,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:03,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 18:59:03,369 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116
[2019-12-27 18:59:03,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 18:59:03,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:03,424 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 18:59:03,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:03,448 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 18:59:03,448 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114
[2019-12-27 18:59:05,772 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 18:59:05,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:05,808 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 18:59:05,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:05,836 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 18:59:05,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:05,847 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 18:59:05,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:05,901 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 18:59:05,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:05,942 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 18:59:05,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:08,354 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 18:59:08,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:08,409 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 18:59:08,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:08,437 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 18:59:08,437 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:08,449 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 18:59:08,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:08,483 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 18:59:08,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:08,506 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 18:59:08,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112
[2019-12-27 18:59:10,895 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2019-12-27 18:59:11,084 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2019-12-27 18:59:11,643 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99
[2019-12-27 18:59:11,653 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 18:59:11,843 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 92
[2019-12-27 18:59:11,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:11,850 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 18:59:12,075 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2019-12-27 18:59:12,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-12-27 18:59:12,076 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 18:59:12,076 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199
[2019-12-27 18:59:12,280 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2019-12-27 18:59:12,496 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2019-12-27 18:59:12,650 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2019-12-27 18:59:13,669 WARN L192 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 120
[2019-12-27 18:59:13,931 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2019-12-27 18:59:14,846 WARN L192 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 120
[2019-12-27 18:59:15,230 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2019-12-27 18:59:16,346 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 122 DAG size of output: 116
[2019-12-27 18:59:16,993 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2019-12-27 18:59:17,607 WARN L192 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116
[2019-12-27 18:59:17,868 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2019-12-27 18:59:17,880 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7579
[2019-12-27 18:59:17,880 INFO L214 etLargeBlockEncoding]: Total number of compositions: 157
[2019-12-27 18:59:17,883 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 42 transitions
[2019-12-27 18:59:17,917 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 603 states.
[2019-12-27 18:59:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states.
[2019-12-27 18:59:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-12-27 18:59:17,925 INFO L403 BasicCegarLoop]: Found error trace
[2019-12-27 18:59:17,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-12-27 18:59:17,927 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 18:59:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 18:59:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash 17160270, now seen corresponding path program 1 times
[2019-12-27 18:59:17,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 18:59:17,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996747677]
[2019-12-27 18:59:17,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 18:59:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 18:59:18,355 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 18:59:18,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996747677]
[2019-12-27 18:59:18,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 18:59:18,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 18:59:18,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880216453]
[2019-12-27 18:59:18,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 18:59:18,368 INFO L197 pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 18:59:18,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions.
[2019-12-27 18:59:18,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 18:59:18,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 18:59:18,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 18:59:18,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 18:59:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 18:59:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 18:59:18,419 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 3 states.
[2019-12-27 18:59:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 18:59:18,603 INFO L93 Difference]: Finished difference Result 726 states and 1832 transitions.
[2019-12-27 18:59:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-12-27 18:59:18,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4
[2019-12-27 18:59:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 18:59:18,625 INFO L225 Difference]: With dead ends: 726
[2019-12-27 18:59:18,626 INFO L226 Difference]: Without dead ends: 651
[2019-12-27 18:59:18,627 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 18:59:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states.
[2019-12-27 18:59:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 587.
[2019-12-27 18:59:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states.
[2019-12-27 18:59:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1469 transitions.
[2019-12-27 18:59:18,752 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1469 transitions. Word has length 4
[2019-12-27 18:59:18,753 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-12-27 18:59:18,753 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1469 transitions.
[2019-12-27 18:59:18,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 18:59:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1469 transitions.
[2019-12-27 18:59:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2019-12-27 18:59:18,754 INFO L403 BasicCegarLoop]: Found error trace
[2019-12-27 18:59:18,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2019-12-27 18:59:18,754 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 18:59:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 18:59:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 531967210, now seen corresponding path program 1 times
[2019-12-27 18:59:18,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 18:59:18,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441228365]
[2019-12-27 18:59:18,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 18:59:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 18:59:18,904 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 18:59:18,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441228365]
[2019-12-27 18:59:18,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 18:59:18,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 18:59:18,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181124047]
[2019-12-27 18:59:18,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 18:59:18,906 INFO L197 pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 18:59:18,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions.
[2019-12-27 18:59:18,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 18:59:18,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 18:59:18,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 18:59:18,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 18:59:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 18:59:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 18:59:18,909 INFO L87 Difference]: Start difference. First operand 587 states and 1469 transitions. Second operand 3 states.
[2019-12-27 18:59:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 18:59:19,041 INFO L93 Difference]: Finished difference Result 678 states and 1676 transitions.
[2019-12-27 18:59:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-12-27 18:59:19,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2019-12-27 18:59:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 18:59:19,047 INFO L225 Difference]: With dead ends: 678
[2019-12-27 18:59:19,047 INFO L226 Difference]: Without dead ends: 662
[2019-12-27 18:59:19,048 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 18:59:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2019-12-27 18:59:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 630.
[2019-12-27 18:59:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states.
[2019-12-27 18:59:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1591 transitions.
[2019-12-27 18:59:19,078 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1591 transitions. Word has length 5
[2019-12-27 18:59:19,079 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-12-27 18:59:19,079 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 1591 transitions.
[2019-12-27 18:59:19,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 18:59:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1591 transitions.
[2019-12-27 18:59:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2019-12-27 18:59:19,080 INFO L403 BasicCegarLoop]: Found error trace
[2019-12-27 18:59:19,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2019-12-27 18:59:19,080 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 18:59:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 18:59:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 923664093, now seen corresponding path program 1 times
[2019-12-27 18:59:19,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 18:59:19,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840971399]
[2019-12-27 18:59:19,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 18:59:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 18:59:19,184 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 18:59:19,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840971399]
[2019-12-27 18:59:19,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 18:59:19,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 18:59:19,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508612195]
[2019-12-27 18:59:19,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 18:59:19,188 INFO L197 pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 18:59:19,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions.
[2019-12-27 18:59:19,189 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 18:59:19,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 18:59:19,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 18:59:19,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 18:59:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 18:59:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 18:59:19,190 INFO L87 Difference]: Start difference. First operand 630 states and 1591 transitions. Second operand 3 states.
[2019-12-27 18:59:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 18:59:19,337 INFO L93 Difference]: Finished difference Result 830 states and 2113 transitions.
[2019-12-27 18:59:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-12-27 18:59:19,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2019-12-27 18:59:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 18:59:19,343 INFO L225 Difference]: With dead ends: 830
[2019-12-27 18:59:19,344 INFO L226 Difference]: Without dead ends: 830
[2019-12-27 18:59:19,344 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 18:59:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states.
[2019-12-27 18:59:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 690.
[2019-12-27 18:59:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states.
[2019-12-27 18:59:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1747 transitions.
[2019-12-27 18:59:19,370 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1747 transitions. Word has length 7
[2019-12-27 18:59:19,370 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-12-27 18:59:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 690 states and 1747 transitions.
[2019-12-27 18:59:19,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 18:59:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1747 transitions.
[2019-12-27 18:59:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-12-27 18:59:19,371 INFO L403 BasicCegarLoop]: Found error trace
[2019-12-27 18:59:19,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 18:59:19,372 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 18:59:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 18:59:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1431185941, now seen corresponding path program 1 times
[2019-12-27 18:59:19,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 18:59:19,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669622096]
[2019-12-27 18:59:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 18:59:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 18:59:19,428 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 18:59:19,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669622096]
[2019-12-27 18:59:19,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 18:59:19,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 18:59:19,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050983344]
[2019-12-27 18:59:19,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 18:59:19,430 INFO L197 pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 18:59:19,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions.
[2019-12-27 18:59:19,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 18:59:19,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 18:59:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 18:59:19,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 18:59:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 18:59:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 18:59:19,433 INFO L87 Difference]: Start difference. First operand 690 states and 1747 transitions. Second operand 3 states.
[2019-12-27 18:59:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 18:59:19,570 INFO L93 Difference]: Finished difference Result 858 states and 2185 transitions.
[2019-12-27 18:59:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-12-27 18:59:19,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8
[2019-12-27 18:59:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 18:59:19,578 INFO L225 Difference]: With dead ends: 858
[2019-12-27 18:59:19,578 INFO L226 Difference]: Without dead ends: 858
[2019-12-27 18:59:19,578 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 18:59:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states.
[2019-12-27 18:59:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 750.
[2019-12-27 18:59:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states.
[2019-12-27 18:59:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1935 transitions.
[2019-12-27 18:59:19,641 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1935 transitions. Word has length 8
[2019-12-27 18:59:19,641 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-12-27 18:59:19,642 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1935 transitions.
[2019-12-27 18:59:19,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 18:59:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1935 transitions.
[2019-12-27 18:59:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2019-12-27 18:59:19,643 INFO L403 BasicCegarLoop]: Found error trace
[2019-12-27 18:59:19,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 18:59:19,644 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 18:59:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 18:59:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash 316402793, now seen corresponding path program 1 times
[2019-12-27 18:59:19,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 18:59:19,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516022206]
[2019-12-27 18:59:19,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 18:59:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 18:59:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 18:59:19,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-12-27 18:59:19,735 INFO L476 BasicCegarLoop]: Counterexample might be feasible
[2019-12-27 18:59:19,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [529] [529] ULTIMATE.startENTRY-->L1713-1: Formula: (let ((.cse1 (store |v_#valid_92| 0 0))) (let ((.cse5 (store .cse1 |v_~#t1~0.base_19| 1))) (let ((.cse2 (store .cse5 |v_~#t2~0.base_15| 1)) (.cse0 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_68 24)) (.cse4 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_68 28))) (and (= v_ULTIMATE.start_my_drv_probe_~d~0.offset_16 .cse0) (= (store (store (store |v_#length_46| |v_~#t1~0.base_19| 4) |v_~#t2~0.base_15| 4) |v_ULTIMATE.start_main_~#data~1.base_145| 32) |v_#length_45|) (= |v_~#t1~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_25|) (= (select .cse1 |v_~#t1~0.base_19|) 0) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_14| v_ULTIMATE.start_my_drv_probe_~data.base_68) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_14| v_ULTIMATE.start_my_drv_probe_~data.offset_68) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#data~1.base_145|)) (= |v_#memory_$Pointer$.offset_335| (let ((.cse3 (store |v_#memory_$Pointer$.offset_336| v_ULTIMATE.start_my_drv_probe_~data.base_68 (store (store (select |v_#memory_$Pointer$.offset_336| v_ULTIMATE.start_my_drv_probe_~data.base_68) .cse0 v_DerPreprocessor_93) .cse4 v_DerPreprocessor_94)))) (store .cse3 |v_~#t1~0.base_19| (store (select .cse3 |v_~#t1~0.base_19|) |v_~#t1~0.offset_19| (select (select |v_#memory_$Pointer$.offset_335| |v_~#t1~0.base_19|) |v_~#t1~0.offset_19|))))) (< |v_#StackHeapBarrier_25| |v_~#t2~0.base_15|) (= (select .cse5 |v_~#t2~0.base_15|) 0) (= (let ((.cse6 (store |v_#memory_int_379| v_ULTIMATE.start_my_drv_probe_~data.base_68 (store (store (select |v_#memory_int_379| v_ULTIMATE.start_my_drv_probe_~data.base_68) .cse0 0) .cse4 0)))) (store .cse6 |v_~#t1~0.base_19| (store (select .cse6 |v_~#t1~0.base_19|) |v_~#t1~0.offset_19| 0))) |v_#memory_int_378|) (= 0 |v_#NULL.base_4|) (= 0 (select (select |v_#memory_int_379| |v_~#t2~0.base_15|) |v_~#t2~0.offset_15|)) (= |v_#pthreadsMutex_143| (store |v_#pthreadsMutex_144| v_ULTIMATE.start_my_drv_probe_~data.base_68 (store (select |v_#pthreadsMutex_144| v_ULTIMATE.start_my_drv_probe_~data.base_68) v_ULTIMATE.start_my_drv_probe_~data.offset_68 0))) (= 0 v_ULTIMATE.start_main_~ret~0_26) (= |v_ULTIMATE.start_my_drv_probe_#in~data.offset_14| |v_ULTIMATE.start_main_~#data~1.offset_141|) (= |v_ULTIMATE.start_my_drv_probe_#in~data.base_14| |v_ULTIMATE.start_main_~#data~1.base_145|) (= |v_#NULL.offset_4| 0) (= v_ULTIMATE.start_my_drv_probe_~res~0_22 0) (= 0 (select (select |v_#memory_int_379| |v_~#t1~0.base_19|) |v_~#t1~0.offset_19|)) (= |v_ULTIMATE.start_my_drv_init_#res_13| v_ULTIMATE.start_main_~ret~0_26) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#data~1.base_145|) (= 0 |v_ULTIMATE.start_main_~#data~1.offset_141|) (= |v_#valid_90| (store .cse2 |v_ULTIMATE.start_main_~#data~1.base_145| 1)) (= (let ((.cse7 (store |v_#memory_$Pointer$.base_336| v_ULTIMATE.start_my_drv_probe_~data.base_68 (store (store (select |v_#memory_$Pointer$.base_336| v_ULTIMATE.start_my_drv_probe_~data.base_68) .cse0 v_DerPreprocessor_95) .cse4 v_DerPreprocessor_96)))) (store .cse7 |v_~#t1~0.base_19| (store (select .cse7 |v_~#t1~0.base_19|) |v_~#t1~0.offset_19| (select (select |v_#memory_$Pointer$.base_335| |v_~#t1~0.base_19|) |v_~#t1~0.offset_19|)))) |v_#memory_$Pointer$.base_335|) (< |v_#StackHeapBarrier_25| |v_~#t1~0.base_19|) (= |v_~#t2~0.offset_15| 0) (= v_ULTIMATE.start_my_drv_probe_~d~0.base_16 v_ULTIMATE.start_my_drv_probe_~data.base_68))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_144|, #StackHeapBarrier=|v_#StackHeapBarrier_25|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_336|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_379|, #length=|v_#length_46|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_336|} OutVars{ULTIMATE.start_main_#t~mem45=|v_ULTIMATE.start_main_#t~mem45_56|, ULTIMATE.start_main_#t~mem46=|v_ULTIMATE.start_main_#t~mem46_75|, ULTIMATE.start_main_#t~mem43=|v_ULTIMATE.start_main_#t~mem43_31|, ULTIMATE.start_main_#t~mem44=|v_ULTIMATE.start_main_#t~mem44_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_335|, ULTIMATE.start_my_drv_probe_#res=|v_ULTIMATE.start_my_drv_probe_#res_26|, #NULL.offset=|v_#NULL.offset_4|, ~#t1~0.offset=|v_~#t1~0.offset_19|, ~#t1~0.base=|v_~#t1~0.base_19|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_68, ULTIMATE.start_my_drv_init_#res=|v_ULTIMATE.start_my_drv_init_#res_13|, ~#t2~0.offset=|v_~#t2~0.offset_15|, ULTIMATE.start_main_~#data~1.offset=|v_ULTIMATE.start_main_~#data~1.offset_141|, #length=|v_#length_45|, ~#t2~0.base=|v_~#t2~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_143|, ULTIMATE.start_my_drv_probe_#in~data.base=|v_ULTIMATE.start_my_drv_probe_#in~data.base_14|, ULTIMATE.start_my_drv_probe_~d~0.offset=v_ULTIMATE.start_my_drv_probe_~d~0.offset_16, ULTIMATE.start_main_~ret~0=v_ULTIMATE.start_main_~ret~0_26, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_68, ULTIMATE.start_main_#t~ret41=|v_ULTIMATE.start_main_#t~ret41_36|, ULTIMATE.start_my_drv_probe_#in~data.offset=|v_ULTIMATE.start_my_drv_probe_#in~data.offset_14|, ULTIMATE.start_main_#t~ret42=|v_ULTIMATE.start_main_#t~ret42_39|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_12|, ULTIMATE.start_my_drv_probe_#t~mem35=|v_ULTIMATE.start_my_drv_probe_#t~mem35_40|, ULTIMATE.start_my_drv_probe_#t~nondet32=|v_ULTIMATE.start_my_drv_probe_#t~nondet32_23|, ULTIMATE.start_my_drv_probe_#t~mem36=|v_ULTIMATE.start_my_drv_probe_#t~mem36_39|, ULTIMATE.start_my_drv_probe_~res~0=v_ULTIMATE.start_my_drv_probe_~res~0_22, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_my_drv_probe_~d~0.base=v_ULTIMATE.start_my_drv_probe_~d~0.base_16, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_378|, ULTIMATE.start_main_~probe_ret~0=v_ULTIMATE.start_main_~probe_ret~0_30, ULTIMATE.start_main_~#data~1.base=|v_ULTIMATE.start_main_~#data~1.base_145|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_335|} AuxVars[v_DerPreprocessor_93, v_DerPreprocessor_94, v_DerPreprocessor_95, v_DerPreprocessor_96] 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~mem35, ULTIMATE.start_my_drv_probe_#t~nondet32, ULTIMATE.start_my_drv_probe_#t~mem36, 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 18:59:19,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [515] [515] my_callbackENTRY-->L1699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork0_~data~0.base_100))) (and (= v_my_callbackThread1of1ForFork0_~arg.offset_10 |v_my_callbackThread1of1ForFork0_#in~arg.offset_4|) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_10 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_16) (= v_my_callbackThread1of1ForFork0_~dev~0.base_10 v_my_callbackThread1of1ForFork0_~__mptr~0.base_16) (= v_my_callbackThread1of1ForFork0_~arg.offset_10 v_my_callbackThread1of1ForFork0_~dev~0.offset_10) (= v_my_callbackThread1of1ForFork0_~data~0.offset_100 (+ v_my_callbackThread1of1ForFork0_~__mptr~0.offset_16 (- 24))) (= (store |v_#pthreadsMutex_114| v_my_callbackThread1of1ForFork0_~data~0.base_100 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_100 1)) |v_#pthreadsMutex_113|) (= v_my_callbackThread1of1ForFork0_~arg.base_10 |v_my_callbackThread1of1ForFork0_#in~arg.base_4|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_100) 0) (= v_my_callbackThread1of1ForFork0_~dev~0.base_10 v_my_callbackThread1of1ForFork0_~arg.base_10) (= v_my_callbackThread1of1ForFork0_~data~0.base_100 v_my_callbackThread1of1ForFork0_~__mptr~0.base_16) (= |v_my_callbackThread1of1ForFork0_#t~nondet30_38| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_114|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_113|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_100, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_4|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_10, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_10, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_4|, my_callbackThread1of1ForFork0_#t~nondet30=|v_my_callbackThread1of1ForFork0_#t~nondet30_38|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_16, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_16, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_10, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_100, 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 18:59:19,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [413] [413] L1713-2-->L1714-1: Formula: (and (= |v_#memory_int_102| (store |v_#memory_int_103| |v_~#t2~0.base_6| (store (select |v_#memory_int_103| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| 1))) (= (store |v_#memory_$Pointer$.base_90| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.base_90| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.base_89| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))) |v_#memory_$Pointer$.base_89|) (= |v_#memory_$Pointer$.offset_89| (store |v_#memory_$Pointer$.offset_90| |v_~#t2~0.base_6| (store (select |v_#memory_$Pointer$.offset_90| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6| (select (select |v_#memory_$Pointer$.offset_89| |v_~#t2~0.base_6|) |v_~#t2~0.offset_6|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_90|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_103|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_90|, ~#t2~0.base=|v_~#t2~0.base_6|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_89|, ~#t2~0.offset=|v_~#t2~0.offset_6|, #memory_int=|v_#memory_int_102|, ULTIMATE.start_my_drv_probe_#t~nondet33=|v_ULTIMATE.start_my_drv_probe_#t~nondet33_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_89|, ~#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 18:59:19,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [398] [398] L1714-2-->L1715-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_my_drv_probe_~data.offset_21 24))) (and (= |v_#memory_$Pointer$.offset_59| (store |v_#memory_$Pointer$.offset_60| v_ULTIMATE.start_my_drv_probe_~data.base_21 (store (select |v_#memory_$Pointer$.offset_60| v_ULTIMATE.start_my_drv_probe_~data.base_21) .cse0 (select (select |v_#memory_$Pointer$.offset_59| v_ULTIMATE.start_my_drv_probe_~data.base_21) .cse0)))) (= (store |v_#memory_int_72| v_ULTIMATE.start_my_drv_probe_~data.base_21 (store (select |v_#memory_int_72| v_ULTIMATE.start_my_drv_probe_~data.base_21) .cse0 3)) |v_#memory_int_71|) (= (store |v_#memory_$Pointer$.base_60| v_ULTIMATE.start_my_drv_probe_~data.base_21 (store (select |v_#memory_$Pointer$.base_60| v_ULTIMATE.start_my_drv_probe_~data.base_21) .cse0 (select (select |v_#memory_$Pointer$.base_59| v_ULTIMATE.start_my_drv_probe_~data.base_21) .cse0))) |v_#memory_$Pointer$.base_59|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_60|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_21, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_21, #memory_int=|v_#memory_int_72|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_60|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_59|, ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_21, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_21, #memory_int=|v_#memory_int_71|, ULTIMATE.start_my_drv_probe_#t~nondet34=|v_ULTIMATE.start_my_drv_probe_#t~nondet34_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_59|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet34, #memory_$Pointer$.offset] because there is no mapped edge
[2019-12-27 18:59:19,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [393] [393] L1699-1-->L1700-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_16 24))) (and (= (store |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 (select (select |v_#memory_$Pointer$.offset_49| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0))) |v_#memory_$Pointer$.offset_49|) (= |v_#memory_$Pointer$.base_49| (store |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 (select (select |v_#memory_$Pointer$.base_49| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0)))) (= (store |v_#memory_int_62| v_my_callbackThread1of1ForFork0_~data~0.base_16 (store (select |v_#memory_int_62| v_my_callbackThread1of1ForFork0_~data~0.base_16) .cse0 1)) |v_#memory_int_61|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_16, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_50|, #memory_int=|v_#memory_int_62|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_16, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_50|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_16, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_49|, #memory_int=|v_#memory_int_61|, 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_49|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#t~nondet30, #memory_$Pointer$.offset] because there is no mapped edge
[2019-12-27 18:59:19,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [500] [500] L1716-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (select (select |v_#memory_int_271| v_ULTIMATE.start_my_drv_probe_~data.base_50) (+ v_ULTIMATE.start_my_drv_probe_~data.offset_50 24)) |v_ULTIMATE.start_my_drv_probe_#t~mem35_22|) (not (= 3 |v_ULTIMATE.start_my_drv_probe_#t~mem35_22|)) (= v_ULTIMATE.start_ldv_assert_~expression_89 0) (= v_ULTIMATE.start_ldv_assert_~expression_89 |v_ULTIMATE.start_ldv_assert_#in~expression_58|)) InVars {ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_50, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_50, #memory_int=|v_#memory_int_271|} OutVars{ULTIMATE.start_my_drv_probe_~data.base=v_ULTIMATE.start_my_drv_probe_~data.base_50, ULTIMATE.start_my_drv_probe_~data.offset=v_ULTIMATE.start_my_drv_probe_~data.offset_50, ULTIMATE.start_my_drv_probe_#t~mem35=|v_ULTIMATE.start_my_drv_probe_#t~mem35_22|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_ldv_assert_#in~expression=|v_ULTIMATE.start_ldv_assert_#in~expression_58|, ULTIMATE.start_ldv_assert_~expression=v_ULTIMATE.start_ldv_assert_~expression_89} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem35, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge
[2019-12-27 18:59:19,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:59:19 BasicIcfg
[2019-12-27 18:59:19,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-12-27 18:59:19,763 INFO L168 Benchmark]: Toolchain (without parser) took 53235.84 ms. Allocated memory was 138.9 MB in the beginning and 326.1 MB in the end (delta: 187.2 MB). Free memory was 99.5 MB in the beginning and 267.2 MB in the end (delta: -167.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,763 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1564.45 ms. Allocated memory was 138.9 MB in the beginning and 237.0 MB in the end (delta: 98.0 MB). Free memory was 99.0 MB in the beginning and 169.8 MB in the end (delta: -70.7 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.25 ms. Allocated memory is still 237.0 MB. Free memory was 169.8 MB in the beginning and 166.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,766 INFO L168 Benchmark]: Boogie Preprocessor took 47.66 ms. Allocated memory is still 237.0 MB. Free memory was 166.8 MB in the beginning and 163.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,766 INFO L168 Benchmark]: RCFGBuilder took 1007.50 ms. Allocated memory is still 237.0 MB. Free memory was 163.9 MB in the beginning and 115.7 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,767 INFO L168 Benchmark]: TraceAbstraction took 50475.64 ms. Allocated memory was 237.0 MB in the beginning and 326.1 MB in the end (delta: 89.1 MB). Free memory was 115.7 MB in the beginning and 267.2 MB in the end (delta: -151.5 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2019-12-27 18:59:19,771 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 1564.45 ms. Allocated memory was 138.9 MB in the beginning and 237.0 MB in the end (delta: 98.0 MB). Free memory was 99.0 MB in the beginning and 169.8 MB in the end (delta: -70.7 MB). Peak memory consumption was 78.1 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 132.25 ms. Allocated memory is still 237.0 MB. Free memory was 169.8 MB in the beginning and 166.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 47.66 ms. Allocated memory is still 237.0 MB. Free memory was 166.8 MB in the beginning and 163.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 1007.50 ms. Allocated memory is still 237.0 MB. Free memory was 163.9 MB in the beginning and 115.7 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 50475.64 ms. Allocated memory was 237.0 MB in the beginning and 326.1 MB in the end (delta: 89.1 MB). Free memory was 115.7 MB in the beginning and 267.2 MB in the end (delta: -151.5 MB). There was no memory consumed. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
LbeTime: 48.4s, 153 ProgramPointsBefore, 43 ProgramPointsAfterwards, 157 TransitionsBefore, 42 TransitionsAfterwards, 4004 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 2101 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 16 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 35.9s, 0 MoverChecksTotal, 7579 CheckedPairsTotal, 157 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={2: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={2:0}]
[L1716] 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={2:0}]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 132 locations, 6 error locations. Result: UNSAFE, OverallTime: 50.2s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 38 SDslu, 41 SDs, 0 SdLazy, 157 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred in iteration=4, 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, 4 MinimizatonAttempts, 344 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...