/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-bf4350c [2020-09-17 01:48:02,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-17 01:48:02,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-17 01:48:02,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-17 01:48:02,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-17 01:48:02,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-17 01:48:02,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-17 01:48:02,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-17 01:48:02,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-17 01:48:02,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-17 01:48:02,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-17 01:48:02,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-17 01:48:02,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-17 01:48:02,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-17 01:48:02,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-17 01:48:02,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-17 01:48:02,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-17 01:48:02,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-17 01:48:02,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-17 01:48:02,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-17 01:48:02,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-17 01:48:02,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-17 01:48:02,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-17 01:48:02,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-17 01:48:02,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-17 01:48:02,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-17 01:48:02,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-17 01:48:02,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-17 01:48:02,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-17 01:48:02,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-17 01:48:02,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-17 01:48:02,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-17 01:48:02,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-17 01:48:02,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-17 01:48:02,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-17 01:48:02,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-17 01:48:02,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-17 01:48:02,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-17 01:48:02,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-17 01:48:02,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-17 01:48:02,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-17 01:48:02,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-17 01:48:02,316 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-17 01:48:02,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-17 01:48:02,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-17 01:48:02,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-17 01:48:02,319 INFO L138 SettingsManager]: * Use SBE=true [2020-09-17 01:48:02,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-17 01:48:02,319 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-17 01:48:02,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-17 01:48:02,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-17 01:48:02,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-17 01:48:02,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-17 01:48:02,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-17 01:48:02,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-17 01:48:02,322 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-17 01:48:02,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-17 01:48:02,322 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-17 01:48:02,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-17 01:48:02,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-17 01:48:02,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-17 01:48:02,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-17 01:48:02,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-17 01:48:02,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-17 01:48:02,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-17 01:48:02,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-17 01:48:02,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-17 01:48:02,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-17 01:48:02,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-17 01:48:02,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-17 01:48:02,325 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-17 01:48:02,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-17 01:48:02,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-17 01:48:02,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-17 01:48:02,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-17 01:48:02,769 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-17 01:48:02,769 INFO L275 PluginConnector]: CDTParser initialized [2020-09-17 01:48:02,771 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-17 01:48:02,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3077aeefa/e6554a4539504977aa0d6963d74cabfa/FLAGd6c710d89 [2020-09-17 01:48:03,579 INFO L306 CDTParser]: Found 1 translation units. [2020-09-17 01:48:03,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-17 01:48:03,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3077aeefa/e6554a4539504977aa0d6963d74cabfa/FLAGd6c710d89 [2020-09-17 01:48:03,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3077aeefa/e6554a4539504977aa0d6963d74cabfa [2020-09-17 01:48:03,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-17 01:48:03,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-17 01:48:03,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-17 01:48:03,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-17 01:48:03,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-17 01:48:03,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 01:48:03" (1/1) ... [2020-09-17 01:48:03,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3699837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:03, skipping insertion in model container [2020-09-17 01:48:03,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 01:48:03" (1/1) ... [2020-09-17 01:48:03,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-17 01:48:03,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-17 01:48:04,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 01:48:04,708 INFO L203 MainTranslator]: Completed pre-run [2020-09-17 01:48:04,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 01:48:05,220 INFO L208 MainTranslator]: Completed translation [2020-09-17 01:48:05,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05 WrapperNode [2020-09-17 01:48:05,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-17 01:48:05,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-17 01:48:05,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-17 01:48:05,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-17 01:48:05,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-17 01:48:05,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-17 01:48:05,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-17 01:48:05,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-17 01:48:05,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (1/1) ... [2020-09-17 01:48:05,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-17 01:48:05,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-17 01:48:05,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-17 01:48:05,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-17 01:48:05,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (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 [2020-09-17 01:48:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-17 01:48:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-17 01:48:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-17 01:48:05,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-17 01:48:05,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-17 01:48:05,644 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-17 01:48:05,644 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-17 01:48:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-17 01:48:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-17 01:48:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-17 01:48:05,649 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-17 01:48:06,468 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-17 01:48:06,468 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-17 01:48:06,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 01:48:06 BoogieIcfgContainer [2020-09-17 01:48:06,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-17 01:48:06,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-17 01:48:06,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-17 01:48:06,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-17 01:48:06,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 01:48:03" (1/3) ... [2020-09-17 01:48:06,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e716761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 01:48:06, skipping insertion in model container [2020-09-17 01:48:06,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 01:48:05" (2/3) ... [2020-09-17 01:48:06,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e716761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 01:48:06, skipping insertion in model container [2020-09-17 01:48:06,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 01:48:06" (3/3) ... [2020-09-17 01:48:06,486 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-09-17 01:48:06,500 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-17 01:48:06,501 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-17 01:48:06,512 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-17 01:48:06,514 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-17 01:48:06,559 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,560 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,560 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,560 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,561 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,561 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,562 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,562 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,562 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,562 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,563 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,563 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,563 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,563 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,564 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,564 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,565 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,566 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,566 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,567 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,567 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,568 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,571 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,571 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,580 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,609 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,610 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,611 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,611 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,611 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 01:48:06,660 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-17 01:48:06,685 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-17 01:48:06,686 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-17 01:48:06,686 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-17 01:48:06,686 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-17 01:48:06,686 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-17 01:48:06,686 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-17 01:48:06,687 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-17 01:48:06,687 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-17 01:48:06,711 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-09-17 01:48:06,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-17 01:48:06,825 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-17 01:48:06,825 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 01:48:06,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-09-17 01:48:06,842 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-17 01:48:06,882 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-17 01:48:06,882 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 01:48:06,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-09-17 01:48:06,886 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-09-17 01:48:06,887 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-17 01:48:07,235 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:07,267 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:07,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:07,311 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:07,342 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:07,364 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:07,364 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:09,960 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:09,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:09,984 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:09,998 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:09,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,000 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-17 01:48:10,471 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:10,514 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:10,542 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,542 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-17 01:48:10,558 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:10,595 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:10,627 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:10,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-17 01:48:12,664 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:12,692 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:12,716 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,716 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:12,740 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:12,769 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:12,791 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:12,791 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:14,837 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:14,865 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:14,885 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,886 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:14,901 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:14,929 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:14,949 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:14,950 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-17 01:48:18,158 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:18,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:18,180 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:18,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:18,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:18,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-17 01:48:18,765 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-17 01:48:19,194 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,228 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,249 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,249 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-09-17 01:48:19,279 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,319 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,360 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-09-17 01:48:19,379 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,422 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:19,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:19,460 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-09-17 01:48:21,482 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:21,520 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:21,549 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,549 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-09-17 01:48:21,564 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,593 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:21,597 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:21,623 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:21,623 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-17 01:48:24,392 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-17 01:48:24,736 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-09-17 01:48:25,282 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-09-17 01:48:25,490 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-09-17 01:48:26,152 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-17 01:48:26,405 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-17 01:48:27,462 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-09-17 01:48:27,489 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:27,990 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-09-17 01:48:27,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:28,000 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:28,485 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-17 01:48:28,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 01:48:28,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-17 01:48:28,487 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-09-17 01:48:29,013 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-17 01:48:29,022 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-09-17 01:48:29,022 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-09-17 01:48:29,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-09-17 01:48:29,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-09-17 01:48:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-09-17 01:48:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-17 01:48:29,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:29,055 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-17 01:48:29,056 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-09-17 01:48:29,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:29,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223757089] [2020-09-17 01:48:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:29,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223757089] [2020-09-17 01:48:29,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:29,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-17 01:48:29,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483638119] [2020-09-17 01:48:29,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-17 01:48:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:29,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-17 01:48:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-17 01:48:29,381 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-09-17 01:48:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:29,405 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-09-17 01:48:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-17 01:48:29,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-17 01:48:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:29,421 INFO L225 Difference]: With dead ends: 190 [2020-09-17 01:48:29,422 INFO L226 Difference]: Without dead ends: 172 [2020-09-17 01:48:29,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-17 01:48:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-17 01:48:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-09-17 01:48:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-09-17 01:48:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-09-17 01:48:29,486 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-09-17 01:48:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:29,486 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-09-17 01:48:29,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-17 01:48:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-09-17 01:48:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-17 01:48:29,487 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:29,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-17 01:48:29,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-17 01:48:29,488 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-09-17 01:48:29,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:29,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244356245] [2020-09-17 01:48:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:29,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244356245] [2020-09-17 01:48:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 01:48:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907222382] [2020-09-17 01:48:29,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 01:48:29,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 01:48:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 01:48:29,792 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-09-17 01:48:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:29,907 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-09-17 01:48:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 01:48:29,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-17 01:48:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:29,916 INFO L225 Difference]: With dead ends: 230 [2020-09-17 01:48:29,916 INFO L226 Difference]: Without dead ends: 230 [2020-09-17 01:48:29,918 INFO L675 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 [2020-09-17 01:48:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-09-17 01:48:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-09-17 01:48:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-17 01:48:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-09-17 01:48:29,957 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-09-17 01:48:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:29,962 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-09-17 01:48:29,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 01:48:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-09-17 01:48:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-17 01:48:29,963 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:29,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-17 01:48:29,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-17 01:48:29,964 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-09-17 01:48:29,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:29,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556421448] [2020-09-17 01:48:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:30,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556421448] [2020-09-17 01:48:30,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:30,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 01:48:30,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515512308] [2020-09-17 01:48:30,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 01:48:30,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 01:48:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 01:48:30,142 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-09-17 01:48:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:30,242 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-09-17 01:48:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 01:48:30,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-17 01:48:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:30,247 INFO L225 Difference]: With dead ends: 243 [2020-09-17 01:48:30,247 INFO L226 Difference]: Without dead ends: 236 [2020-09-17 01:48:30,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 01:48:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-17 01:48:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-09-17 01:48:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-09-17 01:48:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-09-17 01:48:30,279 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-09-17 01:48:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:30,280 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-09-17 01:48:30,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 01:48:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-09-17 01:48:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-17 01:48:30,283 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:30,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:30,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-17 01:48:30,285 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-09-17 01:48:30,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:30,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903652894] [2020-09-17 01:48:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:30,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903652894] [2020-09-17 01:48:30,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:30,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-17 01:48:30,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862365626] [2020-09-17 01:48:30,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 01:48:30,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 01:48:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 01:48:30,433 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-09-17 01:48:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:30,448 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-09-17 01:48:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 01:48:30,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-09-17 01:48:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:30,450 INFO L225 Difference]: With dead ends: 86 [2020-09-17 01:48:30,450 INFO L226 Difference]: Without dead ends: 86 [2020-09-17 01:48:30,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 01:48:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-17 01:48:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-17 01:48:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-17 01:48:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-09-17 01:48:30,454 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-09-17 01:48:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:30,460 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-09-17 01:48:30,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 01:48:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-09-17 01:48:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:30,461 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:30,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:30,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-17 01:48:30,462 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-09-17 01:48:30,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:30,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656029497] [2020-09-17 01:48:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:30,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656029497] [2020-09-17 01:48:30,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:30,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-17 01:48:30,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117418007] [2020-09-17 01:48:30,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 01:48:30,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:30,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 01:48:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-17 01:48:30,922 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-09-17 01:48:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:31,325 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-09-17 01:48:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-17 01:48:31,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-17 01:48:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:31,327 INFO L225 Difference]: With dead ends: 145 [2020-09-17 01:48:31,327 INFO L226 Difference]: Without dead ends: 145 [2020-09-17 01:48:31,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-17 01:48:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-17 01:48:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-09-17 01:48:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-17 01:48:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-09-17 01:48:31,332 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-09-17 01:48:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:31,332 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-09-17 01:48:31,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 01:48:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-09-17 01:48:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:31,334 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:31,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:31,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-17 01:48:31,334 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-09-17 01:48:31,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:31,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791874458] [2020-09-17 01:48:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:32,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791874458] [2020-09-17 01:48:32,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:32,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-17 01:48:32,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395351846] [2020-09-17 01:48:32,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-17 01:48:32,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-17 01:48:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-17 01:48:32,009 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-09-17 01:48:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:32,893 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-09-17 01:48:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 01:48:32,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-17 01:48:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:32,895 INFO L225 Difference]: With dead ends: 157 [2020-09-17 01:48:32,896 INFO L226 Difference]: Without dead ends: 136 [2020-09-17 01:48:32,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-17 01:48:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-09-17 01:48:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-09-17 01:48:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-17 01:48:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-09-17 01:48:32,902 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-09-17 01:48:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:32,902 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-09-17 01:48:32,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-17 01:48:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-09-17 01:48:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:32,904 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:32,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:32,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-17 01:48:32,904 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-09-17 01:48:32,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:32,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853613087] [2020-09-17 01:48:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:33,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853613087] [2020-09-17 01:48:33,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:33,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-17 01:48:33,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477419786] [2020-09-17 01:48:33,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 01:48:33,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 01:48:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-17 01:48:33,259 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-09-17 01:48:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:33,574 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-09-17 01:48:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-17 01:48:33,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-17 01:48:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:33,577 INFO L225 Difference]: With dead ends: 158 [2020-09-17 01:48:33,577 INFO L226 Difference]: Without dead ends: 158 [2020-09-17 01:48:33,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-09-17 01:48:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-09-17 01:48:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-09-17 01:48:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-17 01:48:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-09-17 01:48:33,583 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-09-17 01:48:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:33,584 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-09-17 01:48:33,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 01:48:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-09-17 01:48:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:33,585 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:33,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:33,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-17 01:48:33,586 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-09-17 01:48:33,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:33,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211173952] [2020-09-17 01:48:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:34,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211173952] [2020-09-17 01:48:34,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:34,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-17 01:48:34,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019790316] [2020-09-17 01:48:34,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-17 01:48:34,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:34,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-17 01:48:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-17 01:48:34,160 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-09-17 01:48:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:34,969 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-09-17 01:48:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-17 01:48:34,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-17 01:48:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:34,971 INFO L225 Difference]: With dead ends: 137 [2020-09-17 01:48:34,971 INFO L226 Difference]: Without dead ends: 126 [2020-09-17 01:48:34,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-09-17 01:48:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-17 01:48:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-09-17 01:48:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-17 01:48:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-09-17 01:48:34,976 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-09-17 01:48:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:34,976 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-09-17 01:48:34,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-17 01:48:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-09-17 01:48:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:34,978 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:34,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:34,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-17 01:48:34,978 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-09-17 01:48:34,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:34,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904623465] [2020-09-17 01:48:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:35,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904623465] [2020-09-17 01:48:35,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:35,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-17 01:48:35,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111985568] [2020-09-17 01:48:35,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-17 01:48:35,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-17 01:48:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-17 01:48:35,579 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-09-17 01:48:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:36,381 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-09-17 01:48:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-17 01:48:36,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-17 01:48:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:36,384 INFO L225 Difference]: With dead ends: 139 [2020-09-17 01:48:36,384 INFO L226 Difference]: Without dead ends: 124 [2020-09-17 01:48:36,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-17 01:48:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-17 01:48:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-09-17 01:48:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-17 01:48:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-09-17 01:48:36,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-09-17 01:48:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:36,389 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-09-17 01:48:36,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-17 01:48:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-09-17 01:48:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:36,390 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:36,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:36,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-17 01:48:36,391 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-09-17 01:48:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:36,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35646689] [2020-09-17 01:48:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:36,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35646689] [2020-09-17 01:48:36,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:36,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-17 01:48:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466677433] [2020-09-17 01:48:36,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-17 01:48:36,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-17 01:48:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-17 01:48:36,985 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-09-17 01:48:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:37,762 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-09-17 01:48:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 01:48:37,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-17 01:48:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:37,764 INFO L225 Difference]: With dead ends: 136 [2020-09-17 01:48:37,764 INFO L226 Difference]: Without dead ends: 113 [2020-09-17 01:48:37,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-17 01:48:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-17 01:48:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-09-17 01:48:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-17 01:48:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-09-17 01:48:37,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-09-17 01:48:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:37,769 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-09-17 01:48:37,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-17 01:48:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-09-17 01:48:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:37,770 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:37,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:37,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-17 01:48:37,771 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-09-17 01:48:37,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:37,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223804052] [2020-09-17 01:48:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:38,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223804052] [2020-09-17 01:48:38,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:38,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-17 01:48:38,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64280077] [2020-09-17 01:48:38,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-17 01:48:38,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-17 01:48:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-09-17 01:48:38,278 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-09-17 01:48:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:38,873 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-09-17 01:48:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 01:48:38,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-09-17 01:48:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:38,875 INFO L225 Difference]: With dead ends: 153 [2020-09-17 01:48:38,876 INFO L226 Difference]: Without dead ends: 132 [2020-09-17 01:48:38,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-17 01:48:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-09-17 01:48:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-09-17 01:48:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-17 01:48:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-09-17 01:48:38,880 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-09-17 01:48:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:38,880 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-09-17 01:48:38,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-17 01:48:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-09-17 01:48:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:38,881 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:38,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:38,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-17 01:48:38,882 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-09-17 01:48:38,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:38,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651281726] [2020-09-17 01:48:38,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 01:48:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-17 01:48:39,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651281726] [2020-09-17 01:48:39,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 01:48:39,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-17 01:48:39,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755289977] [2020-09-17 01:48:39,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-17 01:48:39,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 01:48:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-17 01:48:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-17 01:48:39,197 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-09-17 01:48:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 01:48:39,750 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-09-17 01:48:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 01:48:39,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-09-17 01:48:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 01:48:39,753 INFO L225 Difference]: With dead ends: 229 [2020-09-17 01:48:39,753 INFO L226 Difference]: Without dead ends: 229 [2020-09-17 01:48:39,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-09-17 01:48:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-09-17 01:48:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-09-17 01:48:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-17 01:48:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-09-17 01:48:39,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-09-17 01:48:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 01:48:39,759 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-09-17 01:48:39,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-17 01:48:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-09-17 01:48:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-17 01:48:39,760 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 01:48:39,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 01:48:39,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-17 01:48:39,760 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-17 01:48:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 01:48:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-09-17 01:48:39,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 01:48:39,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538111491] [2020-09-17 01:48:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 01:48:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-17 01:48:39,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-17 01:48:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-17 01:48:39,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-17 01:48:39,886 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-17 01:48:39,886 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-17 01:48:39,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-17 01:48:39,887 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-17 01:48:39,887 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-17 01:48:39,888 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-17 01:48:39,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse1 (select |#memory_int_In-1950684861| ULTIMATE.start_my_drv_probe_~data.base_In-1950684861))) (and (= ULTIMATE.start_ldv_assert_~expression_Out-1950684861 1) (let ((.cse0 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-1950684861| 0))) (or (and .cse0 (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1950684861| 1)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1950684861| 0) (not .cse0)))) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-1950684861 24)) 0) (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-1950684861| (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-1950684861 28))))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-1950684861, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-1950684861, #memory_int=|#memory_int_In-1950684861|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-1950684861|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-1950684861|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-1950684861, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-1950684861, #memory_int=|#memory_int_In-1950684861|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-1950684861|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1950684861} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-17 01:48:39,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out807255502 0)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In807255502| 2147483647) (= ULTIMATE.start_ldv_assert_~expression_Out807255502 |ULTIMATE.start_ldv_assert_#in~expression_In807255502|) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In807255502| 2147483648))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In807255502|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In807255502|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out807255502|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In807255502|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In807255502|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out807255502} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-17 01:48:39,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse1 (select |#memory_int_In788253492| |ULTIMATE.start_main_~#data~1.base_In788253492|))) (and (= ULTIMATE.start_ldv_assert_~expression_Out788253492 1) (let ((.cse0 (= 2 |ULTIMATE.start_main_#t~mem43_Out788253492|))) (or (and .cse0 (= |ULTIMATE.start_ldv_assert_#in~expression_Out788253492| 1)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out788253492| 0) (not .cse0)))) (= (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In788253492| 24)) 1) (= (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In788253492| 28)) |ULTIMATE.start_main_#t~mem43_Out788253492|))) InVars {#memory_int=|#memory_int_In788253492|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In788253492|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In788253492|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out788253492|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out788253492|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out788253492|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out788253492|, #memory_int=|#memory_int_In788253492|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In788253492|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out788253492|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In788253492|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out788253492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-17 01:48:39,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 01:48:39 BasicIcfg [2020-09-17 01:48:39,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-17 01:48:39,956 INFO L168 Benchmark]: Toolchain (without parser) took 36210.55 ms. Allocated memory was 148.4 MB in the beginning and 376.4 MB in the end (delta: 228.1 MB). Free memory was 101.2 MB in the beginning and 205.1 MB in the end (delta: -103.9 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,956 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 148.4 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1477.53 ms. Allocated memory was 148.4 MB in the beginning and 237.0 MB in the end (delta: 88.6 MB). Free memory was 100.5 MB in the beginning and 166.9 MB in the end (delta: -66.4 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.23 ms. Allocated memory is still 237.0 MB. Free memory was 166.9 MB in the beginning and 164.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,960 INFO L168 Benchmark]: Boogie Preprocessor took 117.21 ms. Allocated memory is still 237.0 MB. Free memory was 164.1 MB in the beginning and 161.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,964 INFO L168 Benchmark]: RCFGBuilder took 957.15 ms. Allocated memory is still 237.0 MB. Free memory was 161.3 MB in the beginning and 113.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,965 INFO L168 Benchmark]: TraceAbstraction took 33474.42 ms. Allocated memory was 237.0 MB in the beginning and 376.4 MB in the end (delta: 139.5 MB). Free memory was 112.4 MB in the beginning and 205.1 MB in the end (delta: -92.7 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2020-09-17 01:48:39,968 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 148.4 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1477.53 ms. Allocated memory was 148.4 MB in the beginning and 237.0 MB in the end (delta: 88.6 MB). Free memory was 100.5 MB in the beginning and 166.9 MB in the end (delta: -66.4 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 172.23 ms. Allocated memory is still 237.0 MB. Free memory was 166.9 MB in the beginning and 164.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.21 ms. Allocated memory is still 237.0 MB. Free memory was 164.1 MB in the beginning and 161.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 957.15 ms. Allocated memory is still 237.0 MB. Free memory was 161.3 MB in the beginning and 113.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33474.42 ms. Allocated memory was 237.0 MB in the beginning and 376.4 MB in the end (delta: 139.5 MB). Free memory was 112.4 MB in the beginning and 205.1 MB in the end (delta: -92.7 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 22.3s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 996 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.4s, 0 MoverChecksTotal, 2994 CheckedPairsTotal, 159 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.3s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 47943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...