/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 13:18:10,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 13:18:10,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 13:18:10,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 13:18:10,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 13:18:10,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 13:18:10,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 13:18:10,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 13:18:10,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 13:18:10,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 13:18:10,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 13:18:10,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 13:18:10,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 13:18:10,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 13:18:10,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 13:18:10,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 13:18:10,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 13:18:10,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 13:18:10,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 13:18:10,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 13:18:10,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 13:18:10,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 13:18:10,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 13:18:10,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 13:18:10,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 13:18:10,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 13:18:10,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 13:18:10,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 13:18:10,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 13:18:10,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 13:18:10,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 13:18:10,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 13:18:10,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 13:18:10,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 13:18:10,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 13:18:10,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 13:18:10,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 13:18:10,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 13:18:10,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 13:18:10,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 13:18:10,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 13:18:10,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 13:18:10,125 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 13:18:10,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 13:18:10,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 13:18:10,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 13:18:10,127 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 13:18:10,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 13:18:10,130 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 13:18:10,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 13:18:10,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 13:18:10,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 13:18:10,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 13:18:10,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 13:18:10,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 13:18:10,132 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 13:18:10,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 13:18:10,132 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 13:18:10,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 13:18:10,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 13:18:10,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 13:18:10,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 13:18:10,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 13:18:10,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:18:10,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 13:18:10,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 13:18:10,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 13:18:10,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 13:18:10,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 13:18:10,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 13:18:10,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 13:18:10,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 13:18:10,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 13:18:10,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 13:18:10,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 13:18:10,488 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 13:18:10,488 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 13:18:10,489 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-09 13:18:10,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3b1e325/c6b873c88cc443eca9728f42fe319601/FLAGd560c8c3b [2020-10-09 13:18:11,212 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 13:18:11,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-09 13:18:11,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3b1e325/c6b873c88cc443eca9728f42fe319601/FLAGd560c8c3b [2020-10-09 13:18:11,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3b1e325/c6b873c88cc443eca9728f42fe319601 [2020-10-09 13:18:11,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 13:18:11,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 13:18:11,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 13:18:11,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 13:18:11,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 13:18:11,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:18:11" (1/1) ... [2020-10-09 13:18:11,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687cd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:11, skipping insertion in model container [2020-10-09 13:18:11,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:18:11" (1/1) ... [2020-10-09 13:18:11,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 13:18:11,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 13:18:12,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:18:12,372 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 13:18:12,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:18:13,065 INFO L208 MainTranslator]: Completed translation [2020-10-09 13:18:13,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13 WrapperNode [2020-10-09 13:18:13,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 13:18:13,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 13:18:13,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 13:18:13,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 13:18:13,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 13:18:13,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 13:18:13,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 13:18:13,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 13:18:13,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (1/1) ... [2020-10-09 13:18:13,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 13:18:13,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 13:18:13,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 13:18:13,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 13:18:13,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (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-09 13:18:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 13:18:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 13:18:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 13:18:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 13:18:13,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 13:18:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-09 13:18:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-09 13:18:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 13:18:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 13:18:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 13:18:13,329 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 13:18:13,952 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 13:18:13,952 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 13:18:13,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:18:13 BoogieIcfgContainer [2020-10-09 13:18:13,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 13:18:13,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 13:18:13,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 13:18:13,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 13:18:13,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 01:18:11" (1/3) ... [2020-10-09 13:18:13,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d5ca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:18:13, skipping insertion in model container [2020-10-09 13:18:13,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:18:13" (2/3) ... [2020-10-09 13:18:13,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d5ca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:18:13, skipping insertion in model container [2020-10-09 13:18:13,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:18:13" (3/3) ... [2020-10-09 13:18:13,963 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-09 13:18:13,974 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 13:18:13,974 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 13:18:13,982 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-09 13:18:13,983 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 13:18:14,015 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,015 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,015 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,016 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,016 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,016 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,016 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,017 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,017 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,017 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,017 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,017 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,018 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,018 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,018 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,018 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,018 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,019 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,019 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,019 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,019 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,020 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,020 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,020 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,020 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,021 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,023 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,024 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,024 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,024 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,024 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,024 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,025 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,028 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,028 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,029 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,029 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,029 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,029 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,029 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,030 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,030 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,036 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,036 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,038 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:18:14,065 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-09 13:18:14,086 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 13:18:14,086 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 13:18:14,087 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 13:18:14,087 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 13:18:14,087 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 13:18:14,087 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 13:18:14,087 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 13:18:14,087 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 13:18:14,103 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 13:18:14,105 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-09 13:18:14,107 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 148 transitions, 318 flow [2020-10-09 13:18:14,109 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-09 13:18:14,178 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-09 13:18:14,178 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 13:18:14,184 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-09 13:18:14,189 INFO L117 LiptonReduction]: Number of co-enabled transitions 1980 [2020-10-09 13:18:14,496 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-09 13:18:14,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:14,542 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-09 13:18:14,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:14,565 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-09 13:18:14,566 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:14,581 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-09 13:18:14,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:14,611 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-09 13:18:14,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:14,634 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-09 13:18:14,634 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:17,291 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-09 13:18:17,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,343 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-09 13:18:17,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,358 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-09 13:18:17,358 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-09 13:18:17,757 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-09 13:18:17,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,794 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-09 13:18:17,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,819 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-09 13:18:17,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:18:17,838 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-09 13:18:17,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,872 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-09 13:18:17,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:17,900 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-09 13:18:17,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:18:19,934 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-09 13:18:19,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:19,966 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-09 13:18:19,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:19,986 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-09 13:18:19,986 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:20,000 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-09 13:18:20,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:20,028 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-09 13:18:20,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:20,046 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-09 13:18:20,047 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:22,064 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-09 13:18:22,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:22,101 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-09 13:18:22,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:22,122 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-09 13:18:22,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:22,145 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-09 13:18:22,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:22,173 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-09 13:18:22,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:22,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:18:22,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:24,892 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-09 13:18:24,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:24,918 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-09 13:18:24,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:24,945 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-09 13:18:24,946 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-09 13:18:24,956 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-09 13:18:24,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:24,989 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-09 13:18:25,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:25,009 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-09 13:18:25,010 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:18:25,462 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-09 13:18:25,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:25,488 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-09 13:18:25,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:25,503 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-09 13:18:25,503 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-09 13:18:26,444 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-09 13:18:26,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,478 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-09 13:18:26,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,503 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-09 13:18:26,503 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-09 13:18:26,536 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-09 13:18:26,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,588 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-09 13:18:26,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,670 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-09 13:18:26,672 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-10-09 13:18:26,691 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-09 13:18:26,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,741 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-09 13:18:26,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:26,784 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-09 13:18:26,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-10-09 13:18:28,812 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-09 13:18:28,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:28,843 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-09 13:18:28,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:28,868 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-09 13:18:28,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-09 13:18:28,879 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-09 13:18:28,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:28,908 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-09 13:18:28,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:28,936 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-09 13:18:28,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:18:31,167 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-09 13:18:31,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:31,200 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-09 13:18:31,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:31,225 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-09 13:18:31,225 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-09 13:18:31,237 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-09 13:18:31,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:31,267 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:18:31,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:31,290 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-09 13:18:31,290 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:18:33,767 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-09 13:18:34,674 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-09 13:18:34,853 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-09 13:18:35,400 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-09 13:18:35,617 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-09 13:18:36,660 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-09 13:18:36,685 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-09 13:18:37,257 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-09 13:18:37,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:37,267 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:18:37,742 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-09 13:18:37,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:18:37,744 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-09 13:18:37,744 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-09 13:18:38,231 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-09 13:18:38,239 INFO L132 LiptonReduction]: Checked pairs total: 4147 [2020-10-09 13:18:38,240 INFO L134 LiptonReduction]: Total number of compositions: 165 [2020-10-09 13:18:38,247 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-10-09 13:18:38,267 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-10-09 13:18:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-10-09 13:18:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-09 13:18:38,275 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:38,276 INFO L421 BasicCegarLoop]: trace histogram [1] [2020-10-09 13:18:38,277 INFO L429 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-09 13:18:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-09 13:18:38,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:38,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058774675] [2020-10-09 13:18:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:38,524 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-09 13:18:38,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058774675] [2020-10-09 13:18:38,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:38,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-09 13:18:38,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132117457] [2020-10-09 13:18:38,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-09 13:18:38,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-09 13:18:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-09 13:18:38,552 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-10-09 13:18:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:38,580 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-10-09 13:18:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-09 13:18:38,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-09 13:18:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:38,596 INFO L225 Difference]: With dead ends: 190 [2020-10-09 13:18:38,596 INFO L226 Difference]: Without dead ends: 172 [2020-10-09 13:18:38,597 INFO L673 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-09 13:18:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-09 13:18:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-09 13:18:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-09 13:18:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-10-09 13:18:38,661 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-10-09 13:18:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:38,661 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-10-09 13:18:38,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-09 13:18:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-10-09 13:18:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-09 13:18:38,662 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:38,662 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-09 13:18:38,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 13:18:38,663 INFO L429 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-09 13:18:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-10-09 13:18:38,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:38,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913796999] [2020-10-09 13:18:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:38,878 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-09 13:18:38,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913796999] [2020-10-09 13:18:38,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:38,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:18:38,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578393058] [2020-10-09 13:18:38,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:18:38,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:18:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:18:38,882 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-10-09 13:18:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:39,013 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-10-09 13:18:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:18:39,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-09 13:18:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:39,018 INFO L225 Difference]: With dead ends: 230 [2020-10-09 13:18:39,018 INFO L226 Difference]: Without dead ends: 230 [2020-10-09 13:18:39,021 INFO L673 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-09 13:18:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-09 13:18:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-09 13:18:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-09 13:18:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-09 13:18:39,060 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-09 13:18:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:39,061 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-09 13:18:39,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:18:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-09 13:18:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-09 13:18:39,061 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:39,061 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-09 13:18:39,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 13:18:39,062 INFO L429 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-09 13:18:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-10-09 13:18:39,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:39,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287167472] [2020-10-09 13:18:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:39,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287167472] [2020-10-09 13:18:39,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:39,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:18:39,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711141436] [2020-10-09 13:18:39,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:18:39,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:18:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:18:39,129 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-09 13:18:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:39,204 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-09 13:18:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:18:39,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-09 13:18:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:39,207 INFO L225 Difference]: With dead ends: 243 [2020-10-09 13:18:39,208 INFO L226 Difference]: Without dead ends: 236 [2020-10-09 13:18:39,208 INFO L673 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-09 13:18:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-09 13:18:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-09 13:18:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-09 13:18:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-09 13:18:39,226 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-09 13:18:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:39,226 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-09 13:18:39,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:18:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-09 13:18:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 13:18:39,228 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:39,228 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:39,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 13:18:39,228 INFO L429 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-09 13:18:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-10-09 13:18:39,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:39,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11553583] [2020-10-09 13:18:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:39,291 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-09 13:18:39,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11553583] [2020-10-09 13:18:39,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:39,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:18:39,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958390975] [2020-10-09 13:18:39,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:18:39,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:39,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:18:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:18:39,293 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-09 13:18:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:39,306 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-09 13:18:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:18:39,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 13:18:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:39,308 INFO L225 Difference]: With dead ends: 86 [2020-10-09 13:18:39,308 INFO L226 Difference]: Without dead ends: 86 [2020-10-09 13:18:39,308 INFO L673 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-09 13:18:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-09 13:18:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-09 13:18:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-09 13:18:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-09 13:18:39,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-09 13:18:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:39,314 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-09 13:18:39,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:18:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-09 13:18:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:39,315 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:39,315 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:39,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 13:18:39,316 INFO L429 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-09 13:18:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-10-09 13:18:39,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:39,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417961111] [2020-10-09 13:18:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:39,571 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-09 13:18:39,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417961111] [2020-10-09 13:18:39,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:39,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:18:39,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239809168] [2020-10-09 13:18:39,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 13:18:39,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 13:18:39,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-09 13:18:39,573 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-10-09 13:18:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:39,868 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-10-09 13:18:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:18:39,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-09 13:18:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:39,869 INFO L225 Difference]: With dead ends: 145 [2020-10-09 13:18:39,870 INFO L226 Difference]: Without dead ends: 145 [2020-10-09 13:18:39,870 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-09 13:18:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-09 13:18:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-10-09 13:18:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-09 13:18:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-10-09 13:18:39,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-10-09 13:18:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:39,886 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-10-09 13:18:39,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 13:18:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-10-09 13:18:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:39,888 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:39,890 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:39,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 13:18:39,890 INFO L429 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-09 13:18:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-10-09 13:18:39,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:39,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597470801] [2020-10-09 13:18:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:40,486 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-09 13:18:40,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597470801] [2020-10-09 13:18:40,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:40,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:40,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005687354] [2020-10-09 13:18:40,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 13:18:40,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:40,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 13:18:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:40,491 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-10-09 13:18:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:41,275 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-10-09 13:18:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 13:18:41,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-09 13:18:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:41,278 INFO L225 Difference]: With dead ends: 157 [2020-10-09 13:18:41,301 INFO L226 Difference]: Without dead ends: 136 [2020-10-09 13:18:41,302 INFO L673 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-09 13:18:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-09 13:18:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-10-09 13:18:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-09 13:18:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-10-09 13:18:41,307 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-10-09 13:18:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:41,307 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-10-09 13:18:41,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 13:18:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-10-09 13:18:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:41,308 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:41,309 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:41,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 13:18:41,309 INFO L429 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-09 13:18:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-10-09 13:18:41,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:41,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409363767] [2020-10-09 13:18:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:41,479 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-09 13:18:41,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409363767] [2020-10-09 13:18:41,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:41,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:18:41,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652432582] [2020-10-09 13:18:41,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 13:18:41,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 13:18:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 13:18:41,483 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-10-09 13:18:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:41,794 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-10-09 13:18:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:18:41,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-09 13:18:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:41,796 INFO L225 Difference]: With dead ends: 158 [2020-10-09 13:18:41,796 INFO L226 Difference]: Without dead ends: 158 [2020-10-09 13:18:41,797 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-10-09 13:18:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-09 13:18:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-10-09 13:18:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-09 13:18:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-10-09 13:18:41,804 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-10-09 13:18:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:41,805 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-10-09 13:18:41,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 13:18:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-10-09 13:18:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:41,808 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:41,808 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:41,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 13:18:41,809 INFO L429 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-09 13:18:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-10-09 13:18:41,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:41,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136256449] [2020-10-09 13:18:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:42,384 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-09 13:18:42,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136256449] [2020-10-09 13:18:42,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:42,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:42,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94161816] [2020-10-09 13:18:42,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 13:18:42,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 13:18:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:42,389 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-10-09 13:18:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:43,113 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-10-09 13:18:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 13:18:43,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-09 13:18:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:43,115 INFO L225 Difference]: With dead ends: 137 [2020-10-09 13:18:43,115 INFO L226 Difference]: Without dead ends: 126 [2020-10-09 13:18:43,116 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-09 13:18:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-09 13:18:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-10-09 13:18:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-09 13:18:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-10-09 13:18:43,120 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-10-09 13:18:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:43,120 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-10-09 13:18:43,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 13:18:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-10-09 13:18:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:43,121 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:43,122 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:43,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 13:18:43,122 INFO L429 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-09 13:18:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-10-09 13:18:43,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:43,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250048980] [2020-10-09 13:18:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:43,606 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-09 13:18:43,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250048980] [2020-10-09 13:18:43,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:43,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:43,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501142526] [2020-10-09 13:18:43,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 13:18:43,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 13:18:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:43,609 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-10-09 13:18:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:44,316 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-10-09 13:18:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:18:44,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-09 13:18:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:44,318 INFO L225 Difference]: With dead ends: 139 [2020-10-09 13:18:44,318 INFO L226 Difference]: Without dead ends: 124 [2020-10-09 13:18:44,319 INFO L673 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-09 13:18:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-09 13:18:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-10-09 13:18:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-09 13:18:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-10-09 13:18:44,324 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-10-09 13:18:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:44,324 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-10-09 13:18:44,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 13:18:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-10-09 13:18:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:44,325 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:44,325 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:44,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 13:18:44,326 INFO L429 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-09 13:18:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-10-09 13:18:44,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:44,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5662859] [2020-10-09 13:18:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:44,765 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-09 13:18:44,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5662859] [2020-10-09 13:18:44,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:44,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 13:18:44,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277518064] [2020-10-09 13:18:44,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 13:18:44,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 13:18:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:18:44,767 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-10-09 13:18:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:45,511 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-10-09 13:18:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 13:18:45,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-10-09 13:18:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:45,513 INFO L225 Difference]: With dead ends: 136 [2020-10-09 13:18:45,513 INFO L226 Difference]: Without dead ends: 113 [2020-10-09 13:18:45,514 INFO L673 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-09 13:18:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-09 13:18:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-09 13:18:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-09 13:18:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-10-09 13:18:45,518 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-10-09 13:18:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:45,518 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-10-09 13:18:45,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 13:18:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-10-09 13:18:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:45,519 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:45,519 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:45,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 13:18:45,519 INFO L429 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-09 13:18:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:45,520 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-10-09 13:18:45,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:45,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500350841] [2020-10-09 13:18:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:45,842 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-09 13:18:45,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500350841] [2020-10-09 13:18:45,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:45,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 13:18:45,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576581192] [2020-10-09 13:18:45,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 13:18:45,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 13:18:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-09 13:18:45,844 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-10-09 13:18:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:46,418 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-10-09 13:18:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 13:18:46,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-09 13:18:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:46,420 INFO L225 Difference]: With dead ends: 153 [2020-10-09 13:18:46,420 INFO L226 Difference]: Without dead ends: 132 [2020-10-09 13:18:46,421 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-09 13:18:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-09 13:18:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-10-09 13:18:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-09 13:18:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-10-09 13:18:46,425 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-10-09 13:18:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:46,426 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-10-09 13:18:46,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 13:18:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-10-09 13:18:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:46,426 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:46,427 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:46,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 13:18:46,427 INFO L429 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-09 13:18:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-10-09 13:18:46,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:46,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356517348] [2020-10-09 13:18:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:46,612 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-09 13:18:46,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356517348] [2020-10-09 13:18:46,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:46,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:18:46,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755074512] [2020-10-09 13:18:46,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 13:18:46,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 13:18:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:18:46,617 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-10-09 13:18:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:47,099 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-10-09 13:18:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 13:18:47,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-09 13:18:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:47,102 INFO L225 Difference]: With dead ends: 229 [2020-10-09 13:18:47,102 INFO L226 Difference]: Without dead ends: 229 [2020-10-09 13:18:47,106 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-10-09 13:18:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-09 13:18:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-10-09 13:18:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-09 13:18:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-10-09 13:18:47,118 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-10-09 13:18:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:47,118 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-10-09 13:18:47,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 13:18:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-10-09 13:18:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:47,119 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:47,119 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:47,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 13:18:47,119 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:47,120 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-10-09 13:18:47,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:47,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286792130] [2020-10-09 13:18:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:18:47,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:18:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:18:47,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:18:47,245 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 13:18:47,245 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 13:18:47,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 13:18:47,246 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 13:18:47,246 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 13:18:47,247 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 13:18:47,251 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In-1395506676| ULTIMATE.start_my_drv_probe_~data.base_In-1395506676))) (and (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-1395506676| (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-1395506676 28))) (= ULTIMATE.start_ldv_assert_~expression_Out-1395506676 1) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-1395506676| 0))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1395506676| 0) (not .cse1)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1395506676| 1) .cse1))) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-1395506676 24)) 0))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-1395506676, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-1395506676, #memory_int=|#memory_int_In-1395506676|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-1395506676|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-1395506676|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-1395506676, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-1395506676, #memory_int=|#memory_int_In-1395506676|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-1395506676|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1395506676} 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-09 13:18:47,251 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out939044496 |ULTIMATE.start_ldv_assert_#in~expression_In939044496|) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In939044496| 2147483647) (not (= ULTIMATE.start_ldv_assert_~expression_Out939044496 0)) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In939044496| 2147483648))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In939044496|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In939044496|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out939044496|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In939044496|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In939044496|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out939044496} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-09 13:18:47,259 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse1 (select |#memory_int_In1894298784| |ULTIMATE.start_main_~#data~1.base_In1894298784|))) (and (let ((.cse0 (= 2 |ULTIMATE.start_main_#t~mem43_Out1894298784|))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1894298784| 1) .cse0) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out1894298784| 0) (not .cse0)))) (= ULTIMATE.start_ldv_assert_~expression_Out1894298784 1) (= (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In1894298784| 28)) |ULTIMATE.start_main_#t~mem43_Out1894298784|) (= (select .cse1 (+ |ULTIMATE.start_main_~#data~1.offset_In1894298784| 24)) 1))) InVars {#memory_int=|#memory_int_In1894298784|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1894298784|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1894298784|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out1894298784|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out1894298784|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out1894298784|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out1894298784|, #memory_int=|#memory_int_In1894298784|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In1894298784|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out1894298784|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In1894298784|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out1894298784} 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-09 13:18:47,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 01:18:47 BasicIcfg [2020-10-09 13:18:47,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 13:18:47,335 INFO L168 Benchmark]: Toolchain (without parser) took 35903.93 ms. Allocated memory was 251.7 MB in the beginning and 547.9 MB in the end (delta: 296.2 MB). Free memory was 204.5 MB in the beginning and 341.2 MB in the end (delta: -136.7 MB). Peak memory consumption was 159.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:47,336 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:18:47,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1635.75 ms. Allocated memory was 251.7 MB in the beginning and 356.0 MB in the end (delta: 104.3 MB). Free memory was 204.5 MB in the beginning and 315.5 MB in the end (delta: -111.0 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:47,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.81 ms. Allocated memory is still 356.0 MB. Free memory was 315.5 MB in the beginning and 312.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:47,347 INFO L168 Benchmark]: Boogie Preprocessor took 51.70 ms. Allocated memory is still 356.0 MB. Free memory is still 312.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:18:47,347 INFO L168 Benchmark]: RCFGBuilder took 702.48 ms. Allocated memory is still 356.0 MB. Free memory was 312.2 MB in the beginning and 262.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:47,351 INFO L168 Benchmark]: TraceAbstraction took 33378.00 ms. Allocated memory was 356.0 MB in the beginning and 547.9 MB in the end (delta: 191.9 MB). Free memory was 262.1 MB in the beginning and 341.2 MB in the end (delta: -79.1 MB). Peak memory consumption was 112.8 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:47,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1635.75 ms. Allocated memory was 251.7 MB in the beginning and 356.0 MB in the end (delta: 104.3 MB). Free memory was 204.5 MB in the beginning and 315.5 MB in the end (delta: -111.0 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 130.81 ms. Allocated memory is still 356.0 MB. Free memory was 315.5 MB in the beginning and 312.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.70 ms. Allocated memory is still 356.0 MB. Free memory is still 312.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 702.48 ms. Allocated memory is still 356.0 MB. Free memory was 312.2 MB in the beginning and 262.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 33378.00 ms. Allocated memory was 356.0 MB in the beginning and 547.9 MB in the end (delta: 191.9 MB). Free memory was 262.1 MB in the beginning and 341.2 MB in the end (delta: -79.1 MB). Peak memory consumption was 112.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1328 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 24.1s, 144 PlacesBefore, 36 PlacesAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 7 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 165 TotalNumberOfCompositions, 4147 MoverChecksTotal - 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={7: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={7: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={7: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={7: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={7: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={7: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={7:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [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={7: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={7: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={7: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={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.1s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 48623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...