/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-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:43:49,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:43:49,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:43:49,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:43:49,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:43:49,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:43:49,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:43:49,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:43:49,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:43:49,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:43:49,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:43:49,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:43:49,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:43:49,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:43:49,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:43:49,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:43:49,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:43:49,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:43:49,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:43:49,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:43:49,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:43:49,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:43:49,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:43:49,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:43:49,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:43:49,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:43:49,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:43:49,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:43:49,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:43:49,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:43:49,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:43:49,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:43:49,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:43:49,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:43:49,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:43:49,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:43:49,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:43:49,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:43:49,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:43:49,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:43:49,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:43:49,497 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:49,518 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:43:49,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:43:49,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:43:49,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:43:49,520 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:43:49,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:43:49,520 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:43:49,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:43:49,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:43:49,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:43:49,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:43:49,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:43:49,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:43:49,522 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:43:49,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:43:49,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:43:49,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:43:49,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:43:49,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:43:49,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:43:49,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:43:49,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:43:49,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:43:49,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:43:49,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:43:49,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:43:49,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:43:49,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:43:49,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:43:49,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:43:49,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:43:49,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:43:49,842 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:43:49,843 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:43:49,843 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-05 23:43:49,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38135620a/1be2a798c32d4487b1131d5fe01de51a/FLAG9681acb08 [2020-10-05 23:43:50,481 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:43:50,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-05 23:43:50,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38135620a/1be2a798c32d4487b1131d5fe01de51a/FLAG9681acb08 [2020-10-05 23:43:50,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38135620a/1be2a798c32d4487b1131d5fe01de51a [2020-10-05 23:43:50,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:43:50,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:43:50,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:50,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:43:50,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:43:50,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:50" (1/1) ... [2020-10-05 23:43:50,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533978c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:50, skipping insertion in model container [2020-10-05 23:43:50,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:50" (1/1) ... [2020-10-05 23:43:50,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:43:50,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:43:51,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:51,585 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:43:51,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:52,167 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:43:52,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:52 WrapperNode [2020-10-05 23:43:52,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:52,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:52,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:43:52,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:43:52,179 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:52" (1/1) ... [2020-10-05 23:43:52,241 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:52" (1/1) ... [2020-10-05 23:43:52,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:52,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:43:52,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:43:52,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:43:52,308 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:52" (1/1) ... [2020-10-05 23:43:52,309 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:52" (1/1) ... [2020-10-05 23:43:52,327 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:52" (1/1) ... [2020-10-05 23:43:52,328 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:52" (1/1) ... [2020-10-05 23:43:52,364 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:52" (1/1) ... [2020-10-05 23:43:52,370 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:52" (1/1) ... [2020-10-05 23:43:52,385 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:52" (1/1) ... [2020-10-05 23:43:52,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:43:52,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:43:52,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:43:52,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:43:52,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:52" (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:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:43:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 23:43:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-05 23:43:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:43:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:43:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-05 23:43:52,468 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-05 23:43:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:43:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:43:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-05 23:43:52,471 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:53,093 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:43:53,093 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-05 23:43:53,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:53 BoogieIcfgContainer [2020-10-05 23:43:53,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:43:53,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:43:53,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:43:53,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:43:53,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:43:50" (1/3) ... [2020-10-05 23:43:53,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4f71e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:53, skipping insertion in model container [2020-10-05 23:43:53,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:52" (2/3) ... [2020-10-05 23:43:53,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4f71e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:53, skipping insertion in model container [2020-10-05 23:43:53,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:53" (3/3) ... [2020-10-05 23:43:53,104 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-05 23:43:53,115 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:43:53,115 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:43:53,123 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-05 23:43:53,124 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:43:53,156 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:53,156 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:53,156 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,156 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,157 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:53,157 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:53,157 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:53,157 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:53,158 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:53,158 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:53,158 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:53,158 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:53,158 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:53,159 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:53,159 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:53,159 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:53,159 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,160 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,160 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:53,160 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:53,160 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,161 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,161 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,161 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:53,161 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:53,162 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,162 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,162 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:53,162 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:53,163 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:53,163 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:53,163 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:53,163 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:53,163 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:53,164 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:53,164 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:53,164 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:53,164 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:53,165 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:53,165 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,165 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,165 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:53,166 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:53,166 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,166 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,167 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,170 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:53,170 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,171 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,171 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,171 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:53,171 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:53,172 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,172 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,172 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:53,179 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:53,179 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,179 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,180 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:53,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,180 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:53,181 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:53,181 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:53,206 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:43:53,228 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:53,228 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:53,228 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:53,228 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:53,228 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:53,229 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:53,229 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:53,229 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:53,248 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-05 23:43:53,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-05 23:43:53,322 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-05 23:43:53,323 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:53,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-05 23:43:53,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-05 23:43:53,391 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-05 23:43:53,391 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 23:43:53,392 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-05 23:43:53,395 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-10-05 23:43:53,396 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:54,085 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:54,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:54,110 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:54,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:54,128 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:54,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-05 23:43:55,359 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:55,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:55,380 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:55,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:55,392 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:55,392 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-05 23:43:56,186 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:56,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:56,208 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:56,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:43:56,223 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:56,223 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-05 23:43:56,892 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-05 23:43:57,688 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-05 23:43:57,907 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-05 23:43:58,433 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-05 23:43:58,647 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-05 23:43:59,709 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-05 23:43:59,759 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:44:00,228 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:44:00,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:44:00,241 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:44:00,642 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-05 23:44:00,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 23:44:00,644 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:44:00,645 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-05 23:44:01,060 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-05 23:44:01,069 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-10-05 23:44:01,069 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-10-05 23:44:01,073 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-10-05 23:44:01,090 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-05 23:44:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-05 23:44:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-05 23:44:01,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:01,098 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-05 23:44:01,099 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-05 23:44:01,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:01,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259509017] [2020-10-05 23:44:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:01,354 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:44:01,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259509017] [2020-10-05 23:44:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:01,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-05 23:44:01,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566441786] [2020-10-05 23:44:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-05 23:44:01,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-05 23:44:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-05 23:44:01,379 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-10-05 23:44:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:01,404 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-10-05 23:44:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-05 23:44:01,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-05 23:44:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:01,417 INFO L225 Difference]: With dead ends: 190 [2020-10-05 23:44:01,418 INFO L226 Difference]: Without dead ends: 172 [2020-10-05 23:44:01,419 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-05 23:44:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-05 23:44:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-05 23:44:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-05 23:44:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-10-05 23:44:01,496 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-10-05 23:44:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:01,496 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-10-05 23:44:01,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-05 23:44:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-10-05 23:44:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-05 23:44:01,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:01,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-05 23:44:01,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:44:01,498 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:01,498 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-10-05 23:44:01,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:01,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423065900] [2020-10-05 23:44:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:01,687 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:44:01,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423065900] [2020-10-05 23:44:01,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:01,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:44:01,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062964637] [2020-10-05 23:44:01,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:44:01,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:44:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:44:01,690 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-10-05 23:44:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:01,809 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-10-05 23:44:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:44:01,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-05 23:44:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:01,813 INFO L225 Difference]: With dead ends: 230 [2020-10-05 23:44:01,813 INFO L226 Difference]: Without dead ends: 230 [2020-10-05 23:44:01,817 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:44:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-05 23:44:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-05 23:44:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-05 23:44:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-05 23:44:01,854 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-05 23:44:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:01,854 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-05 23:44:01,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:44:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-05 23:44:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:44:01,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:01,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:44:01,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:44:01,855 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-10-05 23:44:01,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:01,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851565790] [2020-10-05 23:44:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:01,951 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:44:01,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851565790] [2020-10-05 23:44:01,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:01,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:44:01,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128258064] [2020-10-05 23:44:01,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:44:01,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:44:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:44:01,954 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-05 23:44:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,037 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-05 23:44:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:44:02,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:44:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,041 INFO L225 Difference]: With dead ends: 243 [2020-10-05 23:44:02,041 INFO L226 Difference]: Without dead ends: 236 [2020-10-05 23:44:02,042 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:44:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-05 23:44:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-05 23:44:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-05 23:44:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-05 23:44:02,055 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-05 23:44:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:02,056 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-05 23:44:02,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:44:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-05 23:44:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:44:02,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:02,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:02,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:44:02,058 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:02,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-10-05 23:44:02,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:02,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45485099] [2020-10-05 23:44:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:02,126 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:44:02,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45485099] [2020-10-05 23:44:02,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:02,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:44:02,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121418866] [2020-10-05 23:44:02,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:44:02,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:44:02,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:44:02,128 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-05 23:44:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,141 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-05 23:44:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:44:02,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:44:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,143 INFO L225 Difference]: With dead ends: 86 [2020-10-05 23:44:02,143 INFO L226 Difference]: Without dead ends: 86 [2020-10-05 23:44:02,143 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:44:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-05 23:44:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-05 23:44:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 23:44:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-05 23:44:02,148 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-05 23:44:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:02,148 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-05 23:44:02,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:44:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-05 23:44:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:02,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:02,150 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:44:02,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:44:02,150 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-10-05 23:44:02,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:02,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806883837] [2020-10-05 23:44:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:02,474 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:44:02,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806883837] [2020-10-05 23:44:02,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:02,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:02,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952963524] [2020-10-05 23:44:02,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:02,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:02,476 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-10-05 23:44:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,774 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-10-05 23:44:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:44:02,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-05 23:44:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,776 INFO L225 Difference]: With dead ends: 145 [2020-10-05 23:44:02,776 INFO L226 Difference]: Without dead ends: 145 [2020-10-05 23:44:02,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-05 23:44:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-10-05 23:44:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-05 23:44:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-10-05 23:44:02,782 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-10-05 23:44:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:02,782 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-10-05 23:44:02,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:44:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-10-05 23:44:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:02,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:02,784 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:44:02,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:44:02,784 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-10-05 23:44:02,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:02,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009232647] [2020-10-05 23:44:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:03,493 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:44:03,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009232647] [2020-10-05 23:44:03,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:03,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:03,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046588901] [2020-10-05 23:44:03,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:03,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:03,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:03,496 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-10-05 23:44:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:04,251 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-10-05 23:44:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:04,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-05 23:44:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:04,253 INFO L225 Difference]: With dead ends: 157 [2020-10-05 23:44:04,253 INFO L226 Difference]: Without dead ends: 136 [2020-10-05 23:44:04,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:44:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-05 23:44:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-10-05 23:44:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-05 23:44:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-10-05 23:44:04,259 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-10-05 23:44:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:04,259 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-10-05 23:44:04,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-10-05 23:44:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:04,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:04,261 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:44:04,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:44:04,262 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-10-05 23:44:04,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:04,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522789207] [2020-10-05 23:44:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:04,708 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:44:04,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522789207] [2020-10-05 23:44:04,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:04,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:44:04,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035391977] [2020-10-05 23:44:04,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:44:04,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:04,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:44:04,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:44:04,710 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 10 states. [2020-10-05 23:44:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:05,260 INFO L93 Difference]: Finished difference Result 176 states and 300 transitions. [2020-10-05 23:44:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:44:05,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-05 23:44:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:05,263 INFO L225 Difference]: With dead ends: 176 [2020-10-05 23:44:05,263 INFO L226 Difference]: Without dead ends: 176 [2020-10-05 23:44:05,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:44:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-05 23:44:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 123. [2020-10-05 23:44:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-05 23:44:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 227 transitions. [2020-10-05 23:44:05,269 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 227 transitions. Word has length 18 [2020-10-05 23:44:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:05,269 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 227 transitions. [2020-10-05 23:44:05,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:44:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 227 transitions. [2020-10-05 23:44:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:05,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:05,270 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:44:05,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:44:05,271 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-10-05 23:44:05,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:05,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588016285] [2020-10-05 23:44:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:05,838 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:44:05,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588016285] [2020-10-05 23:44:05,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:05,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:05,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754749635] [2020-10-05 23:44:05,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:05,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:05,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:05,840 INFO L87 Difference]: Start difference. First operand 123 states and 227 transitions. Second operand 12 states. [2020-10-05 23:44:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:06,447 INFO L93 Difference]: Finished difference Result 174 states and 298 transitions. [2020-10-05 23:44:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:44:06,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-05 23:44:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:06,450 INFO L225 Difference]: With dead ends: 174 [2020-10-05 23:44:06,450 INFO L226 Difference]: Without dead ends: 163 [2020-10-05 23:44:06,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:44:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-05 23:44:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2020-10-05 23:44:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-05 23:44:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 233 transitions. [2020-10-05 23:44:06,455 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 233 transitions. Word has length 18 [2020-10-05 23:44:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:06,455 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 233 transitions. [2020-10-05 23:44:06,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 233 transitions. [2020-10-05 23:44:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:06,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:06,456 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:44:06,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:44:06,457 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-10-05 23:44:06,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:06,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006391506] [2020-10-05 23:44:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:06,977 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:44:06,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006391506] [2020-10-05 23:44:06,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:06,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:06,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782485528] [2020-10-05 23:44:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:06,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:06,979 INFO L87 Difference]: Start difference. First operand 127 states and 233 transitions. Second operand 12 states. [2020-10-05 23:44:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:07,704 INFO L93 Difference]: Finished difference Result 176 states and 301 transitions. [2020-10-05 23:44:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:07,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-05 23:44:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:07,706 INFO L225 Difference]: With dead ends: 176 [2020-10-05 23:44:07,706 INFO L226 Difference]: Without dead ends: 161 [2020-10-05 23:44:07,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:44:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-05 23:44:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 125. [2020-10-05 23:44:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-05 23:44:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2020-10-05 23:44:07,712 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 18 [2020-10-05 23:44:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:07,712 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2020-10-05 23:44:07,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2020-10-05 23:44:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:07,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:07,713 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:44:07,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:44:07,714 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-10-05 23:44:07,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:07,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385542461] [2020-10-05 23:44:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:08,224 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:44:08,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385542461] [2020-10-05 23:44:08,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:08,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:44:08,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670268546] [2020-10-05 23:44:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:44:08,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:44:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:44:08,226 INFO L87 Difference]: Start difference. First operand 125 states and 229 transitions. Second operand 12 states. [2020-10-05 23:44:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:08,908 INFO L93 Difference]: Finished difference Result 170 states and 294 transitions. [2020-10-05 23:44:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:08,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-05 23:44:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:08,910 INFO L225 Difference]: With dead ends: 170 [2020-10-05 23:44:08,910 INFO L226 Difference]: Without dead ends: 147 [2020-10-05 23:44:08,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:44:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-05 23:44:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 119. [2020-10-05 23:44:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-05 23:44:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 218 transitions. [2020-10-05 23:44:08,914 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 218 transitions. Word has length 18 [2020-10-05 23:44:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:08,915 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 218 transitions. [2020-10-05 23:44:08,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:44:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 218 transitions. [2020-10-05 23:44:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:08,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:08,916 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:44:08,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:44:08,916 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-10-05 23:44:08,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:08,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032777661] [2020-10-05 23:44:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:09,381 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:44:09,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032777661] [2020-10-05 23:44:09,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:09,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:44:09,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971948612] [2020-10-05 23:44:09,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:09,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:09,387 INFO L87 Difference]: Start difference. First operand 119 states and 218 transitions. Second operand 11 states. [2020-10-05 23:44:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:09,880 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2020-10-05 23:44:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:44:09,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-05 23:44:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:09,885 INFO L225 Difference]: With dead ends: 173 [2020-10-05 23:44:09,885 INFO L226 Difference]: Without dead ends: 152 [2020-10-05 23:44:09,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:44:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-05 23:44:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2020-10-05 23:44:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-05 23:44:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 224 transitions. [2020-10-05 23:44:09,891 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 224 transitions. Word has length 18 [2020-10-05 23:44:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:09,892 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 224 transitions. [2020-10-05 23:44:09,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 224 transitions. [2020-10-05 23:44:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:44:09,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:09,893 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:44:09,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:44:09,893 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:44:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:09,894 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-10-05 23:44:09,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:09,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848000525] [2020-10-05 23:44:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:44:09,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:44:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:44:09,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:44:10,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:44:10,012 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:44:10,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:44:10,013 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:44:10,013 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:44:10,014 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:44:10,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse1 (select |#memory_int_In-553637389| ULTIMATE.start_my_drv_probe_~data.base_In-553637389))) (and (let ((.cse0 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-553637389| 0))) (or (and (not .cse0) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-553637389| 0)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-553637389| 1) .cse0))) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-553637389 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out-553637389|) (= (select .cse1 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-553637389 24)) 0) (= ULTIMATE.start_ldv_assert_~expression_Out-553637389 1))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-553637389, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-553637389, #memory_int=|#memory_int_In-553637389|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-553637389|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-553637389|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-553637389, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-553637389, #memory_int=|#memory_int_In-553637389|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-553637389|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-553637389} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-05 23:44:10,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out-864117457 |ULTIMATE.start_ldv_assert_#in~expression_In-864117457|) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In-864117457| 2147483647) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In-864117457| 2147483648)) (not (= ULTIMATE.start_ldv_assert_~expression_Out-864117457 0))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-864117457|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-864117457|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-864117457|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In-864117457|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-864117457|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-864117457} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-05 23:44:10,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In-1944882836| |ULTIMATE.start_main_~#data~1.base_In-1944882836|))) (and (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In-1944882836| 28)) |ULTIMATE.start_main_#t~mem43_Out-1944882836|) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In-1944882836| 24)) 1) (= ULTIMATE.start_ldv_assert_~expression_Out-1944882836 1) (let ((.cse1 (= |ULTIMATE.start_main_#t~mem43_Out-1944882836| 2))) (or (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1944882836| 1)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1944882836| 0) (not .cse1)))))) InVars {#memory_int=|#memory_int_In-1944882836|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1944882836|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1944882836|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out-1944882836|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out-1944882836|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out-1944882836|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out-1944882836|, #memory_int=|#memory_int_In-1944882836|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1944882836|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-1944882836|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1944882836|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1944882836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-05 23:44:10,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:44:10 BasicIcfg [2020-10-05 23:44:10,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:44:10,106 INFO L168 Benchmark]: Toolchain (without parser) took 19447.43 ms. Allocated memory was 141.0 MB in the beginning and 405.8 MB in the end (delta: 264.8 MB). Free memory was 100.8 MB in the beginning and 211.7 MB in the end (delta: -111.0 MB). Peak memory consumption was 153.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,107 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1511.93 ms. Allocated memory was 141.0 MB in the beginning and 237.0 MB in the end (delta: 95.9 MB). Free memory was 100.5 MB in the beginning and 170.4 MB in the end (delta: -69.8 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.73 ms. Allocated memory is still 237.0 MB. Free memory was 170.4 MB in the beginning and 167.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,112 INFO L168 Benchmark]: Boogie Preprocessor took 100.43 ms. Allocated memory is still 237.0 MB. Free memory was 167.5 MB in the beginning and 164.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,115 INFO L168 Benchmark]: RCFGBuilder took 697.01 ms. Allocated memory is still 237.0 MB. Free memory was 164.6 MB in the beginning and 117.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,116 INFO L168 Benchmark]: TraceAbstraction took 17004.89 ms. Allocated memory was 237.0 MB in the beginning and 405.8 MB in the end (delta: 168.8 MB). Free memory was 115.7 MB in the beginning and 211.7 MB in the end (delta: -96.0 MB). Peak memory consumption was 72.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:44:10,118 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.37 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1511.93 ms. Allocated memory was 141.0 MB in the beginning and 237.0 MB in the end (delta: 95.9 MB). Free memory was 100.5 MB in the beginning and 170.4 MB in the end (delta: -69.8 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.73 ms. Allocated memory is still 237.0 MB. Free memory was 170.4 MB in the beginning and 167.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.43 ms. Allocated memory is still 237.0 MB. Free memory was 167.5 MB in the beginning and 164.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.01 ms. Allocated memory is still 237.0 MB. Free memory was 164.6 MB in the beginning and 117.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17004.89 ms. Allocated memory was 237.0 MB in the beginning and 405.8 MB in the end (delta: 168.8 MB). Free memory was 115.7 MB in the beginning and 211.7 MB in the end (delta: -96.0 MB). Peak memory consumption was 72.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.8s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 996 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2994 CheckedPairsTotal, 159 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.b=0, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={6:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 271 SDtfs, 310 SDslu, 854 SDs, 0 SdLazy, 2117 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 302 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 54607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...