/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:43:32,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:43:32,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:43:32,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:43:32,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:43:32,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:43:32,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:43:32,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:43:32,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:43:32,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:43:32,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:43:32,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:43:32,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:43:32,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:43:32,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:43:32,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:43:32,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:43:32,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:43:32,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:43:32,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:43:32,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:43:32,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:43:32,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:43:32,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:43:32,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:43:32,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:43:32,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:43:32,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:43:32,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:43:32,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:43:32,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:43:32,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:43:32,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:43:32,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:43:32,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:43:32,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:43:32,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:43:32,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:43:32,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:43:32,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:43:32,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:43:32,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:43:32,296 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:43:32,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:43:32,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:43:32,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:43:32,298 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:43:32,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:43:32,298 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:43:32,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:43:32,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:43:32,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:43:32,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:43:32,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:43:32,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:43:32,300 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:43:32,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:43:32,300 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:43:32,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:43:32,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:43:32,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:43:32,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:43:32,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:43:32,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:43:32,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:43:32,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:43:32,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:43:32,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:43:32,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:43:32,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:43:32,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:43:32,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:43:32,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:43:32,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:43:32,629 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:43:32,629 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:43:32,630 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-05 23:43:32,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d6e220/e7770724623b4de589e71bc1a028713d/FLAGa1b45fab1 [2020-10-05 23:43:33,307 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:43:33,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-05 23:43:33,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d6e220/e7770724623b4de589e71bc1a028713d/FLAGa1b45fab1 [2020-10-05 23:43:33,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d6e220/e7770724623b4de589e71bc1a028713d [2020-10-05 23:43:33,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:43:33,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:43:33,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:33,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:43:33,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:43:33,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:33" (1/1) ... [2020-10-05 23:43:33,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6649cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:33, skipping insertion in model container [2020-10-05 23:43:33,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:33" (1/1) ... [2020-10-05 23:43:33,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:43:33,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:43:34,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:34,690 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:43:34,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:35,240 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:43:35,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35 WrapperNode [2020-10-05 23:43:35,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:35,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:35,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:43:35,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:43:35,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:35,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:43:35,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:43:35,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:43:35,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (1/1) ... [2020-10-05 23:43:35,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:43:35,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:43:35,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:43:35,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:43:35,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (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-10-05 23:43:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:43:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 23:43:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-05 23:43:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:43:35,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:43:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-05 23:43:35,500 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-05 23:43:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:43:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:43:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-05 23:43:35,503 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:43:36,129 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:43:36,130 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-05 23:43:36,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:36 BoogieIcfgContainer [2020-10-05 23:43:36,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:43:36,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:43:36,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:43:36,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:43:36,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:43:33" (1/3) ... [2020-10-05 23:43:36,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e2d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:36, skipping insertion in model container [2020-10-05 23:43:36,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:35" (2/3) ... [2020-10-05 23:43:36,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e2d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:36, skipping insertion in model container [2020-10-05 23:43:36,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:36" (3/3) ... [2020-10-05 23:43:36,146 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-10-05 23:43:36,158 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:43:36,159 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:43:36,169 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-05 23:43:36,170 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:43:36,215 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,215 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,215 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,216 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,216 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,216 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,216 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,217 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,217 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,217 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,217 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,220 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,220 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,222 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,222 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,229 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,229 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,231 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,232 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,232 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,233 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,233 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,233 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,233 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,236 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,237 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,238 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,238 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,246 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,246 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,247 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,247 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,247 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,248 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,248 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,248 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,248 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,248 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,249 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:36,274 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:43:36,296 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:36,297 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:36,297 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:36,297 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:36,297 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:36,297 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:36,297 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:36,298 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:36,318 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-05 23:43:36,320 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-05 23:43:36,395 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-05 23:43:36,396 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:36,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-10-05 23:43:36,407 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-05 23:43:36,447 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-05 23:43:36,448 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:36,449 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-10-05 23:43:36,452 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2200 [2020-10-05 23:43:36,453 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:37,060 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:37,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:37,090 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:37,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:37,105 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:37,105 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-05 23:43:38,422 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:38,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:38,452 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:38,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:38,475 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:38,476 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-05 23:43:38,779 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-10-05 23:43:39,114 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-05 23:43:39,138 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:39,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:39,242 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 23:43:39,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:39,312 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-10-05 23:43:39,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-10-05 23:43:39,872 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-10-05 23:43:40,515 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-05 23:43:40,841 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-05 23:43:41,070 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-05 23:43:41,297 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-05 23:43:41,482 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2954 [2020-10-05 23:43:41,482 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2020-10-05 23:43:41,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-05 23:43:41,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-10-05 23:43:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-10-05 23:43:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-05 23:43:41,510 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:41,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-05 23:43:41,511 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-10-05 23:43:41,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:41,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509177907] [2020-10-05 23:43:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:41,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509177907] [2020-10-05 23:43:41,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:41,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:43:41,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419920506] [2020-10-05 23:43:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:41,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:41,982 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-10-05 23:43:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:42,122 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-10-05 23:43:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:42,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-05 23:43:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:42,140 INFO L225 Difference]: With dead ends: 248 [2020-10-05 23:43:42,141 INFO L226 Difference]: Without dead ends: 230 [2020-10-05 23:43:42,142 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-10-05 23:43:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-05 23:43:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-05 23:43:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-05 23:43:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-05 23:43:42,245 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-05 23:43:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:42,245 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-05 23:43:42,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-05 23:43:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:43:42,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:42,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:43:42,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:43:42,248 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-10-05 23:43:42,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:42,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073555435] [2020-10-05 23:43:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:42,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073555435] [2020-10-05 23:43:42,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:42,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:43:42,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473664999] [2020-10-05 23:43:42,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:42,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:42,323 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-05 23:43:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:42,418 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-05 23:43:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:42,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:43:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:42,422 INFO L225 Difference]: With dead ends: 243 [2020-10-05 23:43:42,422 INFO L226 Difference]: Without dead ends: 236 [2020-10-05 23:43:42,424 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-10-05 23:43:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-05 23:43:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-05 23:43:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-05 23:43:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-05 23:43:42,441 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-05 23:43:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:42,441 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-05 23:43:42,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-05 23:43:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:43:42,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:42,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:42,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:43:42,444 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-10-05 23:43:42,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:42,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709650133] [2020-10-05 23:43:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:42,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709650133] [2020-10-05 23:43:42,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:42,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:42,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969068090] [2020-10-05 23:43:42,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:42,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:42,506 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-05 23:43:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:42,527 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-05 23:43:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:42,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:43:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:42,528 INFO L225 Difference]: With dead ends: 86 [2020-10-05 23:43:42,529 INFO L226 Difference]: Without dead ends: 86 [2020-10-05 23:43:42,529 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-10-05 23:43:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-05 23:43:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-05 23:43:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 23:43:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-05 23:43:42,535 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-05 23:43:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:42,535 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-05 23:43:42,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-05 23:43:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:42,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:42,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:42,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:43:42,537 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-10-05 23:43:42,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:42,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579123798] [2020-10-05 23:43:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:42,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579123798] [2020-10-05 23:43:42,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:42,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:42,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299184900] [2020-10-05 23:43:42,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:43:42,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:43:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:43:42,904 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 13 states. [2020-10-05 23:43:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:43,862 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-10-05 23:43:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-05 23:43:43,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-05 23:43:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:43,864 INFO L225 Difference]: With dead ends: 86 [2020-10-05 23:43:43,864 INFO L226 Difference]: Without dead ends: 74 [2020-10-05 23:43:43,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2020-10-05 23:43:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-05 23:43:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-05 23:43:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-05 23:43:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-10-05 23:43:43,870 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-10-05 23:43:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:43,870 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-10-05 23:43:43,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:43:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-10-05 23:43:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:43,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:43,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:43,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:43:43,872 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-10-05 23:43:43,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:43,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228505777] [2020-10-05 23:43:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:44,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228505777] [2020-10-05 23:43:44,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:43:44,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174916787] [2020-10-05 23:43:44,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:43:44,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:43:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:44,279 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 8 states. [2020-10-05 23:43:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:44,563 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-10-05 23:43:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:43:44,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-05 23:43:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:44,565 INFO L225 Difference]: With dead ends: 117 [2020-10-05 23:43:44,566 INFO L226 Difference]: Without dead ends: 117 [2020-10-05 23:43:44,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-05 23:43:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-10-05 23:43:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 23:43:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-05 23:43:44,575 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-05 23:43:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:44,576 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-05 23:43:44,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:43:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-05 23:43:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:44,577 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:44,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:44,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:43:44,578 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-10-05 23:43:44,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:44,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750421343] [2020-10-05 23:43:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:45,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750421343] [2020-10-05 23:43:45,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:45,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:45,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940568549] [2020-10-05 23:43:45,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:45,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:45,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:45,456 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 14 states. [2020-10-05 23:43:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:46,387 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2020-10-05 23:43:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:43:46,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:46,389 INFO L225 Difference]: With dead ends: 153 [2020-10-05 23:43:46,389 INFO L226 Difference]: Without dead ends: 145 [2020-10-05 23:43:46,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:43:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-05 23:43:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2020-10-05 23:43:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-05 23:43:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2020-10-05 23:43:46,395 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 18 [2020-10-05 23:43:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:46,395 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2020-10-05 23:43:46,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2020-10-05 23:43:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:46,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:46,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:46,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:43:46,397 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-10-05 23:43:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:46,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275588348] [2020-10-05 23:43:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:47,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275588348] [2020-10-05 23:43:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:47,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:47,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376994546] [2020-10-05 23:43:47,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:47,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:47,130 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 14 states. [2020-10-05 23:43:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:48,113 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2020-10-05 23:43:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:43:48,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:48,115 INFO L225 Difference]: With dead ends: 155 [2020-10-05 23:43:48,115 INFO L226 Difference]: Without dead ends: 143 [2020-10-05 23:43:48,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:43:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-05 23:43:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2020-10-05 23:43:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-05 23:43:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 181 transitions. [2020-10-05 23:43:48,121 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 181 transitions. Word has length 18 [2020-10-05 23:43:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:48,121 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 181 transitions. [2020-10-05 23:43:48,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 181 transitions. [2020-10-05 23:43:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:48,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:48,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:48,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:43:48,123 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1347055900, now seen corresponding path program 3 times [2020-10-05 23:43:48,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:48,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493353176] [2020-10-05 23:43:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:49,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493353176] [2020-10-05 23:43:49,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:49,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:49,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318941169] [2020-10-05 23:43:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:49,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:49,009 INFO L87 Difference]: Start difference. First operand 98 states and 181 transitions. Second operand 14 states. [2020-10-05 23:43:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:49,950 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2020-10-05 23:43:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:49,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:49,952 INFO L225 Difference]: With dead ends: 139 [2020-10-05 23:43:49,953 INFO L226 Difference]: Without dead ends: 123 [2020-10-05 23:43:49,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:43:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-05 23:43:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-10-05 23:43:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 23:43:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-05 23:43:49,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-05 23:43:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:49,958 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-05 23:43:49,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-05 23:43:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:49,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:49,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:49,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:43:49,960 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-10-05 23:43:49,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:49,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677770936] [2020-10-05 23:43:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:50,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677770936] [2020-10-05 23:43:50,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:50,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:43:50,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617030385] [2020-10-05 23:43:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:43:50,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:43:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:43:50,216 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 8 states. [2020-10-05 23:43:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:50,579 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2020-10-05 23:43:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:43:50,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-05 23:43:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:50,581 INFO L225 Difference]: With dead ends: 119 [2020-10-05 23:43:50,581 INFO L226 Difference]: Without dead ends: 119 [2020-10-05 23:43:50,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:43:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-05 23:43:50,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2020-10-05 23:43:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 23:43:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-05 23:43:50,586 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-05 23:43:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:50,586 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-05 23:43:50,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:43:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-05 23:43:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:50,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:50,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:50,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:43:50,588 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 4 times [2020-10-05 23:43:50,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:50,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482848196] [2020-10-05 23:43:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:51,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482848196] [2020-10-05 23:43:51,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:51,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175908967] [2020-10-05 23:43:51,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:51,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:51,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:51,292 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2020-10-05 23:43:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:52,216 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2020-10-05 23:43:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:52,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:52,222 INFO L225 Difference]: With dead ends: 135 [2020-10-05 23:43:52,222 INFO L226 Difference]: Without dead ends: 113 [2020-10-05 23:43:52,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:43:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-05 23:43:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2020-10-05 23:43:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-05 23:43:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2020-10-05 23:43:52,226 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 18 [2020-10-05 23:43:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:52,227 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2020-10-05 23:43:52,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2020-10-05 23:43:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:52,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:52,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:52,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:43:52,228 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash -318962108, now seen corresponding path program 5 times [2020-10-05 23:43:52,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:52,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048598270] [2020-10-05 23:43:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:52,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048598270] [2020-10-05 23:43:52,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:52,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:52,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651247775] [2020-10-05 23:43:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:52,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:52,950 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand 14 states. [2020-10-05 23:43:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,880 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-10-05 23:43:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:43:53,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,882 INFO L225 Difference]: With dead ends: 152 [2020-10-05 23:43:53,882 INFO L226 Difference]: Without dead ends: 144 [2020-10-05 23:43:53,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:43:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-05 23:43:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-10-05 23:43:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-05 23:43:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 187 transitions. [2020-10-05 23:43:53,886 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 187 transitions. Word has length 18 [2020-10-05 23:43:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,886 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 187 transitions. [2020-10-05 23:43:53,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2020-10-05 23:43:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:53,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:53,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:43:53,888 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash -569697014, now seen corresponding path program 6 times [2020-10-05 23:43:53,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917710741] [2020-10-05 23:43:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:54,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917710741] [2020-10-05 23:43:54,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:54,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:54,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51656835] [2020-10-05 23:43:54,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:54,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:54,606 INFO L87 Difference]: Start difference. First operand 100 states and 187 transitions. Second operand 14 states. [2020-10-05 23:43:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:55,508 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2020-10-05 23:43:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 23:43:55,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:55,512 INFO L225 Difference]: With dead ends: 154 [2020-10-05 23:43:55,512 INFO L226 Difference]: Without dead ends: 142 [2020-10-05 23:43:55,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:43:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-05 23:43:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2020-10-05 23:43:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-05 23:43:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2020-10-05 23:43:55,517 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 18 [2020-10-05 23:43:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:55,517 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2020-10-05 23:43:55,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2020-10-05 23:43:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:55,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:55,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:55,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:43:55,518 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash -269125948, now seen corresponding path program 7 times [2020-10-05 23:43:55,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:55,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873876895] [2020-10-05 23:43:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:56,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873876895] [2020-10-05 23:43:56,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:56,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:56,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417837203] [2020-10-05 23:43:56,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:56,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:56,216 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand 14 states. [2020-10-05 23:43:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:57,103 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2020-10-05 23:43:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:43:57,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:57,105 INFO L225 Difference]: With dead ends: 149 [2020-10-05 23:43:57,105 INFO L226 Difference]: Without dead ends: 133 [2020-10-05 23:43:57,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:43:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-05 23:43:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2020-10-05 23:43:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 23:43:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 179 transitions. [2020-10-05 23:43:57,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 179 transitions. Word has length 18 [2020-10-05 23:43:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:57,112 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 179 transitions. [2020-10-05 23:43:57,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 179 transitions. [2020-10-05 23:43:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:57,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:57,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:57,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:43:57,113 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:57,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash -969779638, now seen corresponding path program 8 times [2020-10-05 23:43:57,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:57,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321468997] [2020-10-05 23:43:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:57,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321468997] [2020-10-05 23:43:57,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:57,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:43:57,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717214565] [2020-10-05 23:43:57,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:43:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:43:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:43:57,882 INFO L87 Difference]: Start difference. First operand 96 states and 179 transitions. Second operand 14 states. [2020-10-05 23:43:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:58,789 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2020-10-05 23:43:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:43:58,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 23:43:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:58,791 INFO L225 Difference]: With dead ends: 167 [2020-10-05 23:43:58,791 INFO L226 Difference]: Without dead ends: 147 [2020-10-05 23:43:58,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:43:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-05 23:43:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 94. [2020-10-05 23:43:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 23:43:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-05 23:43:58,797 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-05 23:43:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:58,797 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-05 23:43:58,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:43:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-05 23:43:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:58,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:58,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:58,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:43:58,800 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-10-05 23:43:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:58,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263955927] [2020-10-05 23:43:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:43:59,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263955927] [2020-10-05 23:43:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:59,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:43:59,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755598815] [2020-10-05 23:43:59,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:59,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:59,273 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 11 states. [2020-10-05 23:43:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:59,778 INFO L93 Difference]: Finished difference Result 206 states and 364 transitions. [2020-10-05 23:43:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:43:59,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-05 23:43:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:59,780 INFO L225 Difference]: With dead ends: 206 [2020-10-05 23:43:59,780 INFO L226 Difference]: Without dead ends: 206 [2020-10-05 23:43:59,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:43:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-05 23:43:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 116. [2020-10-05 23:43:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-05 23:43:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-10-05 23:43:59,790 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 18 [2020-10-05 23:43:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:59,791 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-10-05 23:43:59,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-10-05 23:43:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:59,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:59,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:59,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:43:59,792 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 9 times [2020-10-05 23:43:59,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:59,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721934742] [2020-10-05 23:43:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:59,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:59,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:59,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:43:59,940 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:43:59,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:43:59,942 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:43:59,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (= |ULTIMATE.start_ldv_assert_#in~expression_In-1954084369| ULTIMATE.start_ldv_assert_~expression_Out-1954084369) (not (= 0 ULTIMATE.start_ldv_assert_~expression_Out-1954084369))) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1954084369|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out-1954084369|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1954084369|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1954084369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-05 23:44:00,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:44:00 BasicIcfg [2020-10-05 23:44:00,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:44:00,012 INFO L168 Benchmark]: Toolchain (without parser) took 26452.98 ms. Allocated memory was 136.8 MB in the beginning and 502.8 MB in the end (delta: 366.0 MB). Free memory was 96.7 MB in the beginning and 453.4 MB in the end (delta: -356.7 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,012 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1682.19 ms. Allocated memory was 136.8 MB in the beginning and 228.6 MB in the end (delta: 91.8 MB). Free memory was 96.5 MB in the beginning and 168.0 MB in the end (delta: -71.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.34 ms. Allocated memory is still 228.6 MB. Free memory was 168.0 MB in the beginning and 165.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,014 INFO L168 Benchmark]: Boogie Preprocessor took 54.60 ms. Allocated memory is still 228.6 MB. Free memory was 165.0 MB in the beginning and 162.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,015 INFO L168 Benchmark]: RCFGBuilder took 711.96 ms. Allocated memory is still 228.6 MB. Free memory was 162.0 MB in the beginning and 116.6 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,016 INFO L168 Benchmark]: TraceAbstraction took 23872.28 ms. Allocated memory was 228.6 MB in the beginning and 502.8 MB in the end (delta: 274.2 MB). Free memory was 116.6 MB in the beginning and 453.4 MB in the end (delta: -336.7 MB). Peak memory consumption was 277.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:00,020 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1682.19 ms. Allocated memory was 136.8 MB in the beginning and 228.6 MB in the end (delta: 91.8 MB). Free memory was 96.5 MB in the beginning and 168.0 MB in the end (delta: -71.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.34 ms. Allocated memory is still 228.6 MB. Free memory was 168.0 MB in the beginning and 165.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.60 ms. Allocated memory is still 228.6 MB. Free memory was 165.0 MB in the beginning and 162.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 711.96 ms. Allocated memory is still 228.6 MB. Free memory was 162.0 MB in the beginning and 116.6 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23872.28 ms. Allocated memory was 228.6 MB in the beginning and 502.8 MB in the end (delta: 274.2 MB). Free memory was 116.6 MB in the beginning and 453.4 MB in the end (delta: -336.7 MB). Peak memory consumption was 277.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 129 ProgramPointsBefore, 34 ProgramPointsAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 1101 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2954 CheckedPairsTotal, 134 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; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, t1={5:0}, t2={7:0}] [L1696] 1 struct device *dev = (struct device*)arg; [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1700] 1 data->shared.b VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1696] 2 struct device *dev = (struct device*)arg; [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data->shared.b=0, dev={6:24}, t1={5:0}, t2={7: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; [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] [L1738] 0 data.shared.a [L1739] 0 data.shared.b [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={5:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 269 SDtfs, 583 SDslu, 947 SDs, 0 SdLazy, 3861 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 497 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 79189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...