/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:28:56,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:28:56,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:28:56,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:28:56,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:28:56,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:28:56,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:28:56,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:28:56,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:28:56,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:28:56,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:28:56,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:28:56,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:28:56,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:28:56,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:28:56,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:28:56,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:28:56,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:28:56,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:28:56,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:28:56,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:28:56,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:28:56,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:28:56,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:28:56,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:28:56,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:28:56,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:28:56,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:28:56,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:28:56,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:28:56,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:28:56,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:28:56,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:28:56,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:28:56,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:28:56,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:28:56,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:28:56,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:28:56,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:28:56,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:28:56,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:28:56,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 10:28:56,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:28:56,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:28:56,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:28:56,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:28:56,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:28:56,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:28:56,726 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:28:56,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:28:56,726 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:28:56,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:28:56,727 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:28:56,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:28:56,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:28:56,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:28:56,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 10:28:56,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:28:56,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:28:56,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:28:56,984 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:28:56,985 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:28:56,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2021-06-05 10:28:57,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca02cab03/2b571690e5fb41e5b94282ff180b78e5/FLAG21ecc0ea0 [2021-06-05 10:28:57,541 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:28:57,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2021-06-05 10:28:57,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca02cab03/2b571690e5fb41e5b94282ff180b78e5/FLAG21ecc0ea0 [2021-06-05 10:28:58,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca02cab03/2b571690e5fb41e5b94282ff180b78e5 [2021-06-05 10:28:58,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:28:58,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:28:58,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:28:58,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:28:58,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:28:58,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e66ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58, skipping insertion in model container [2021-06-05 10:28:58,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:28:58,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:28:58,196 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 10:28:58,504 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2021-06-05 10:28:58,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:28:58,529 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:28:58,535 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 10:28:58,557 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2021-06-05 10:28:58,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:28:58,740 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:28:58,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58 WrapperNode [2021-06-05 10:28:58,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:28:58,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:28:58,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:28:58,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:28:58,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:28:58,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:28:58,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:28:58,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:28:58,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (1/1) ... [2021-06-05 10:28:58,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:28:58,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:28:58,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:28:58,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:28:58,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (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 [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 10:28:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:28:58,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:28:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-06-05 10:28:58,881 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-06-05 10:28:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:28:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:28:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:28:58,882 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:28:59,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:28:59,443 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-06-05 10:28:59,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:28:59 BoogieIcfgContainer [2021-06-05 10:28:59,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:28:59,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:28:59,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:28:59,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:28:59,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:28:58" (1/3) ... [2021-06-05 10:28:59,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476f1d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:28:59, skipping insertion in model container [2021-06-05 10:28:59,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:28:58" (2/3) ... [2021-06-05 10:28:59,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476f1d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:28:59, skipping insertion in model container [2021-06-05 10:28:59,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:28:59" (3/3) ... [2021-06-05 10:28:59,449 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2021-06-05 10:28:59,452 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:28:59,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:28:59,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-06-05 10:28:59,453 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:28:59,476 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,479 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,480 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,481 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,482 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,483 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,485 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,487 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,488 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,489 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,490 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,491 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,492 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,493 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,505 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,505 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,505 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,507 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,507 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,508 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,510 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,510 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,511 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:28:59,522 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 10:28:59,536 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-05 10:28:59,547 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:28:59,547 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:28:59,548 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:28:59,548 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:28:59,548 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:28:59,548 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:28:59,548 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:28:59,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:28:59,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 155 transitions, 332 flow [2021-06-05 10:28:59,776 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8331 states, 8318 states have (on average 2.820149074296706) internal successors, (23458), 8330 states have internal predecessors, (23458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:28:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 8331 states, 8318 states have (on average 2.820149074296706) internal successors, (23458), 8330 states have internal predecessors, (23458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:28:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 10:28:59,814 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:28:59,814 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:28:59,814 INFO L430 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]=== [2021-06-05 10:28:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:28:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1877077339, now seen corresponding path program 1 times [2021-06-05 10:28:59,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:28:59,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085476674] [2021-06-05 10:28:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:28:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:00,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:00,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085476674] [2021-06-05 10:29:00,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085476674] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:00,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:00,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:00,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308435830] [2021-06-05 10:29:00,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:00,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:00,109 INFO L87 Difference]: Start difference. First operand has 8331 states, 8318 states have (on average 2.820149074296706) internal successors, (23458), 8330 states have internal predecessors, (23458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:00,468 INFO L93 Difference]: Finished difference Result 10982 states and 30392 transitions. [2021-06-05 10:29:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:29:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 10:29:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:00,515 INFO L225 Difference]: With dead ends: 10982 [2021-06-05 10:29:00,516 INFO L226 Difference]: Without dead ends: 9197 [2021-06-05 10:29:00,516 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:29:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9197 states. [2021-06-05 10:29:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9197 to 7212. [2021-06-05 10:29:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7212 states, 7203 states have (on average 2.752464251006525) internal successors, (19826), 7211 states have internal predecessors, (19826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 19826 transitions. [2021-06-05 10:29:00,808 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 19826 transitions. Word has length 48 [2021-06-05 10:29:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:00,809 INFO L482 AbstractCegarLoop]: Abstraction has 7212 states and 19826 transitions. [2021-06-05 10:29:00,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 19826 transitions. [2021-06-05 10:29:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 10:29:00,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:00,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:00,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:29:00,817 INFO L430 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]=== [2021-06-05 10:29:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1490656626, now seen corresponding path program 1 times [2021-06-05 10:29:00,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:00,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507277882] [2021-06-05 10:29:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:00,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:00,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507277882] [2021-06-05 10:29:00,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507277882] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:00,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:00,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:29:00,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311027036] [2021-06-05 10:29:00,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:29:00,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:29:00,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:29:00,974 INFO L87 Difference]: Start difference. First operand 7212 states and 19826 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:01,182 INFO L93 Difference]: Finished difference Result 9859 states and 26909 transitions. [2021-06-05 10:29:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 10:29:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 10:29:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:01,208 INFO L225 Difference]: With dead ends: 9859 [2021-06-05 10:29:01,208 INFO L226 Difference]: Without dead ends: 8378 [2021-06-05 10:29:01,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:29:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2021-06-05 10:29:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8114. [2021-06-05 10:29:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8114 states, 8106 states have (on average 2.752899087095978) internal successors, (22315), 8113 states have internal predecessors, (22315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 22315 transitions. [2021-06-05 10:29:01,374 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 22315 transitions. Word has length 54 [2021-06-05 10:29:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:01,375 INFO L482 AbstractCegarLoop]: Abstraction has 8114 states and 22315 transitions. [2021-06-05 10:29:01,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 22315 transitions. [2021-06-05 10:29:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 10:29:01,382 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:01,382 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:01,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:29:01,383 INFO L430 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]=== [2021-06-05 10:29:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 867317945, now seen corresponding path program 1 times [2021-06-05 10:29:01,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:01,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558051885] [2021-06-05 10:29:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:01,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:01,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558051885] [2021-06-05 10:29:01,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558051885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:01,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:01,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 10:29:01,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527391313] [2021-06-05 10:29:01,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 10:29:01,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 10:29:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 10:29:01,475 INFO L87 Difference]: Start difference. First operand 8114 states and 22315 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:01,506 INFO L93 Difference]: Finished difference Result 3194 states and 8459 transitions. [2021-06-05 10:29:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 10:29:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 10:29:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:01,515 INFO L225 Difference]: With dead ends: 3194 [2021-06-05 10:29:01,515 INFO L226 Difference]: Without dead ends: 3194 [2021-06-05 10:29:01,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:29:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-06-05 10:29:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2021-06-05 10:29:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3188 states have (on average 2.653387703889586) internal successors, (8459), 3193 states have internal predecessors, (8459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 8459 transitions. [2021-06-05 10:29:01,595 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 8459 transitions. Word has length 68 [2021-06-05 10:29:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:01,595 INFO L482 AbstractCegarLoop]: Abstraction has 3194 states and 8459 transitions. [2021-06-05 10:29:01,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 8459 transitions. [2021-06-05 10:29:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:29:01,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:01,600 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:01,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:29:01,600 INFO L430 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]=== [2021-06-05 10:29:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1859350192, now seen corresponding path program 1 times [2021-06-05 10:29:01,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:01,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607448259] [2021-06-05 10:29:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:01,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:01,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607448259] [2021-06-05 10:29:01,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607448259] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:01,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:01,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:29:01,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078606385] [2021-06-05 10:29:01,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:29:01,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:29:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:29:01,686 INFO L87 Difference]: Start difference. First operand 3194 states and 8459 transitions. Second operand has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:01,738 INFO L93 Difference]: Finished difference Result 3251 states and 8550 transitions. [2021-06-05 10:29:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:29:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 10:29:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:01,744 INFO L225 Difference]: With dead ends: 3251 [2021-06-05 10:29:01,744 INFO L226 Difference]: Without dead ends: 3251 [2021-06-05 10:29:01,744 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:29:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2021-06-05 10:29:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3202. [2021-06-05 10:29:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 3196 states have (on average 2.650500625782228) internal successors, (8471), 3201 states have internal predecessors, (8471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 8471 transitions. [2021-06-05 10:29:01,797 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 8471 transitions. Word has length 77 [2021-06-05 10:29:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:01,797 INFO L482 AbstractCegarLoop]: Abstraction has 3202 states and 8471 transitions. [2021-06-05 10:29:01,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 8471 transitions. [2021-06-05 10:29:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 10:29:01,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:01,803 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:01,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:29:01,803 INFO L430 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]=== [2021-06-05 10:29:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1805281448, now seen corresponding path program 1 times [2021-06-05 10:29:01,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:01,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405697133] [2021-06-05 10:29:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:01,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:01,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405697133] [2021-06-05 10:29:01,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405697133] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:01,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:01,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:29:01,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51030916] [2021-06-05 10:29:01,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:29:01,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:29:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:29:01,890 INFO L87 Difference]: Start difference. First operand 3202 states and 8471 transitions. Second operand has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:01,943 INFO L93 Difference]: Finished difference Result 3247 states and 8540 transitions. [2021-06-05 10:29:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:29:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 10:29:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:01,949 INFO L225 Difference]: With dead ends: 3247 [2021-06-05 10:29:01,949 INFO L226 Difference]: Without dead ends: 3247 [2021-06-05 10:29:01,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:29:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-06-05 10:29:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3210. [2021-06-05 10:29:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3204 states have (on average 2.6513732833957553) internal successors, (8495), 3209 states have internal predecessors, (8495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 8495 transitions. [2021-06-05 10:29:02,009 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 8495 transitions. Word has length 78 [2021-06-05 10:29:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:02,010 INFO L482 AbstractCegarLoop]: Abstraction has 3210 states and 8495 transitions. [2021-06-05 10:29:02,010 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 8495 transitions. [2021-06-05 10:29:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:02,014 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:02,014 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:02,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:29:02,014 INFO L430 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]=== [2021-06-05 10:29:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1156921516, now seen corresponding path program 1 times [2021-06-05 10:29:02,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:02,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273039980] [2021-06-05 10:29:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:02,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:02,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273039980] [2021-06-05 10:29:02,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273039980] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:02,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:02,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:02,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592900088] [2021-06-05 10:29:02,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:02,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:02,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:02,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:02,537 INFO L87 Difference]: Start difference. First operand 3210 states and 8495 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:04,156 INFO L93 Difference]: Finished difference Result 3252 states and 8568 transitions. [2021-06-05 10:29:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 10:29:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:04,161 INFO L225 Difference]: With dead ends: 3252 [2021-06-05 10:29:04,161 INFO L226 Difference]: Without dead ends: 3252 [2021-06-05 10:29:04,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1160.6ms TimeCoverageRelationStatistics Valid=540, Invalid=1622, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 10:29:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2021-06-05 10:29:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3210. [2021-06-05 10:29:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3204 states have (on average 2.648876404494382) internal successors, (8487), 3209 states have internal predecessors, (8487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 8487 transitions. [2021-06-05 10:29:04,227 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 8487 transitions. Word has length 85 [2021-06-05 10:29:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:04,228 INFO L482 AbstractCegarLoop]: Abstraction has 3210 states and 8487 transitions. [2021-06-05 10:29:04,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 8487 transitions. [2021-06-05 10:29:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:04,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:04,235 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:04,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:29:04,235 INFO L430 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]=== [2021-06-05 10:29:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1271700082, now seen corresponding path program 1 times [2021-06-05 10:29:04,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:04,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970346281] [2021-06-05 10:29:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:04,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:04,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970346281] [2021-06-05 10:29:04,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970346281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:04,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:04,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:04,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16921971] [2021-06-05 10:29:04,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:04,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:04,855 INFO L87 Difference]: Start difference. First operand 3210 states and 8487 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:06,014 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2021-06-05 10:29:06,175 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 10:29:06,343 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 10:29:06,564 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 10:29:06,766 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 10:29:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:06,954 INFO L93 Difference]: Finished difference Result 4001 states and 10490 transitions. [2021-06-05 10:29:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:06,960 INFO L225 Difference]: With dead ends: 4001 [2021-06-05 10:29:06,960 INFO L226 Difference]: Without dead ends: 4001 [2021-06-05 10:29:06,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1759.9ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2021-06-05 10:29:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 3310. [2021-06-05 10:29:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3304 states have (on average 2.6458837772397095) internal successors, (8742), 3309 states have internal predecessors, (8742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 8742 transitions. [2021-06-05 10:29:07,012 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 8742 transitions. Word has length 85 [2021-06-05 10:29:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:07,013 INFO L482 AbstractCegarLoop]: Abstraction has 3310 states and 8742 transitions. [2021-06-05 10:29:07,013 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 8742 transitions. [2021-06-05 10:29:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:07,017 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:07,017 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:07,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:29:07,017 INFO L430 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]=== [2021-06-05 10:29:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash -183958924, now seen corresponding path program 2 times [2021-06-05 10:29:07,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:07,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727656106] [2021-06-05 10:29:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:07,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:07,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727656106] [2021-06-05 10:29:07,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727656106] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:07,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:07,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:07,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143972684] [2021-06-05 10:29:07,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:07,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:07,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:07,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:07,570 INFO L87 Difference]: Start difference. First operand 3310 states and 8742 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:08,200 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-06-05 10:29:08,745 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 10:29:08,936 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 10:29:09,134 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 10:29:09,356 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 10:29:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:09,505 INFO L93 Difference]: Finished difference Result 4446 states and 11675 transitions. [2021-06-05 10:29:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:09,512 INFO L225 Difference]: With dead ends: 4446 [2021-06-05 10:29:09,512 INFO L226 Difference]: Without dead ends: 4446 [2021-06-05 10:29:09,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1681.4ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2021-06-05 10:29:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 3340. [2021-06-05 10:29:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3340 states, 3334 states have (on average 2.6490701859628074) internal successors, (8832), 3339 states have internal predecessors, (8832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 8832 transitions. [2021-06-05 10:29:09,558 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 8832 transitions. Word has length 85 [2021-06-05 10:29:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:09,558 INFO L482 AbstractCegarLoop]: Abstraction has 3340 states and 8832 transitions. [2021-06-05 10:29:09,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 8832 transitions. [2021-06-05 10:29:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:09,562 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:09,562 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:09,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:29:09,562 INFO L430 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]=== [2021-06-05 10:29:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash -755420778, now seen corresponding path program 3 times [2021-06-05 10:29:09,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:09,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48673360] [2021-06-05 10:29:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:10,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:10,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48673360] [2021-06-05 10:29:10,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48673360] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:10,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:10,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:10,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021031242] [2021-06-05 10:29:10,051 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:10,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:10,051 INFO L87 Difference]: Start difference. First operand 3340 states and 8832 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:11,192 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 10:29:11,375 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 10:29:11,569 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 10:29:11,767 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 10:29:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:11,902 INFO L93 Difference]: Finished difference Result 4401 states and 11555 transitions. [2021-06-05 10:29:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:11,908 INFO L225 Difference]: With dead ends: 4401 [2021-06-05 10:29:11,908 INFO L226 Difference]: Without dead ends: 4401 [2021-06-05 10:29:11,908 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1649.5ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2021-06-05 10:29:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3350. [2021-06-05 10:29:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3344 states have (on average 2.65011961722488) internal successors, (8862), 3349 states have internal predecessors, (8862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 8862 transitions. [2021-06-05 10:29:11,951 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 8862 transitions. Word has length 85 [2021-06-05 10:29:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:11,951 INFO L482 AbstractCegarLoop]: Abstraction has 3350 states and 8862 transitions. [2021-06-05 10:29:11,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 8862 transitions. [2021-06-05 10:29:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:11,955 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:11,955 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:11,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:29:11,956 INFO L430 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]=== [2021-06-05 10:29:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2138904882, now seen corresponding path program 4 times [2021-06-05 10:29:11,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:11,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972877361] [2021-06-05 10:29:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:12,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:12,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972877361] [2021-06-05 10:29:12,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972877361] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:12,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:12,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:12,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955192920] [2021-06-05 10:29:12,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:12,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:12,397 INFO L87 Difference]: Start difference. First operand 3350 states and 8862 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:13,530 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 10:29:13,721 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 10:29:13,905 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 10:29:14,122 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 10:29:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:14,212 INFO L93 Difference]: Finished difference Result 4141 states and 10840 transitions. [2021-06-05 10:29:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:14,217 INFO L225 Difference]: With dead ends: 4141 [2021-06-05 10:29:14,217 INFO L226 Difference]: Without dead ends: 4141 [2021-06-05 10:29:14,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1627.3ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2021-06-05 10:29:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3360. [2021-06-05 10:29:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3360 states, 3354 states have (on average 2.648181276088253) internal successors, (8882), 3359 states have internal predecessors, (8882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 8882 transitions. [2021-06-05 10:29:14,259 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 8882 transitions. Word has length 85 [2021-06-05 10:29:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:14,259 INFO L482 AbstractCegarLoop]: Abstraction has 3360 states and 8882 transitions. [2021-06-05 10:29:14,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 8882 transitions. [2021-06-05 10:29:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:14,263 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:14,264 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:14,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:29:14,264 INFO L430 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]=== [2021-06-05 10:29:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash 748608168, now seen corresponding path program 5 times [2021-06-05 10:29:14,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:14,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051488288] [2021-06-05 10:29:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:14,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:14,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051488288] [2021-06-05 10:29:14,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051488288] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:14,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:14,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 10:29:14,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858605249] [2021-06-05 10:29:14,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 10:29:14,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 10:29:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:29:14,670 INFO L87 Difference]: Start difference. First operand 3360 states and 8882 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:15,510 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-06-05 10:29:15,689 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-05 10:29:15,876 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-06-05 10:29:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:15,979 INFO L93 Difference]: Finished difference Result 3998 states and 10541 transitions. [2021-06-05 10:29:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 10:29:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:15,984 INFO L225 Difference]: With dead ends: 3998 [2021-06-05 10:29:15,984 INFO L226 Difference]: Without dead ends: 3998 [2021-06-05 10:29:15,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1268.0ms TimeCoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2021-06-05 10:29:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2021-06-05 10:29:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3560. [2021-06-05 10:29:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3554 states have (on average 2.6567248171074844) internal successors, (9442), 3559 states have internal predecessors, (9442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 9442 transitions. [2021-06-05 10:29:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 9442 transitions. Word has length 85 [2021-06-05 10:29:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:16,026 INFO L482 AbstractCegarLoop]: Abstraction has 3560 states and 9442 transitions. [2021-06-05 10:29:16,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 9442 transitions. [2021-06-05 10:29:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:16,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:16,033 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:16,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:29:16,033 INFO L430 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]=== [2021-06-05 10:29:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash -915711888, now seen corresponding path program 6 times [2021-06-05 10:29:16,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:16,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327086545] [2021-06-05 10:29:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:29:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:29:16,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:29:16,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327086545] [2021-06-05 10:29:16,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327086545] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:29:16,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:29:16,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 10:29:16,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366514571] [2021-06-05 10:29:16,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:29:16,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:29:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:29:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:29:16,531 INFO L87 Difference]: Start difference. First operand 3560 states and 9442 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:17,536 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2021-06-05 10:29:17,676 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 10:29:17,873 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 10:29:18,057 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-06-05 10:29:18,251 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2021-06-05 10:29:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:29:18,433 INFO L93 Difference]: Finished difference Result 5504 states and 13915 transitions. [2021-06-05 10:29:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 10:29:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 10:29:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:29:18,440 INFO L225 Difference]: With dead ends: 5504 [2021-06-05 10:29:18,441 INFO L226 Difference]: Without dead ends: 5504 [2021-06-05 10:29:18,441 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1704.8ms TimeCoverageRelationStatistics Valid=350, Invalid=840, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 10:29:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2021-06-05 10:29:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 3598. [2021-06-05 10:29:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 3592 states have (on average 2.651447661469933) internal successors, (9524), 3597 states have internal predecessors, (9524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 9524 transitions. [2021-06-05 10:29:18,526 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 9524 transitions. Word has length 85 [2021-06-05 10:29:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:29:18,527 INFO L482 AbstractCegarLoop]: Abstraction has 3598 states and 9524 transitions. [2021-06-05 10:29:18,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 9524 transitions. [2021-06-05 10:29:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 10:29:18,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:29:18,531 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:29:18,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:29:18,531 INFO L430 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]=== [2021-06-05 10:29:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:29:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 970805360, now seen corresponding path program 7 times [2021-06-05 10:29:18,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:29:18,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926119237] [2021-06-05 10:29:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:29:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:29:18,553 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:29:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:29:18,572 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:29:18,601 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:29:18,602 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:29:18,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:29:18,604 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:29:18,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:29:18 BasicIcfg [2021-06-05 10:29:18,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:29:18,671 INFO L168 Benchmark]: Toolchain (without parser) took 20612.01 ms. Allocated memory was 343.9 MB in the beginning and 1.1 GB in the end (delta: 725.6 MB). Free memory was 304.8 MB in the beginning and 925.8 MB in the end (delta: -621.1 MB). Peak memory consumption was 106.5 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,671 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory was 324.6 MB in the beginning and 324.6 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:29:18,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.36 ms. Allocated memory is still 343.9 MB. Free memory was 304.5 MB in the beginning and 288.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 343.9 MB. Free memory was 288.5 MB in the beginning and 285.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,672 INFO L168 Benchmark]: Boogie Preprocessor took 40.91 ms. Allocated memory is still 343.9 MB. Free memory was 285.4 MB in the beginning and 282.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,672 INFO L168 Benchmark]: RCFGBuilder took 604.24 ms. Allocated memory is still 343.9 MB. Free memory was 282.3 MB in the beginning and 224.6 MB in the end (delta: 57.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,672 INFO L168 Benchmark]: TraceAbstraction took 19225.54 ms. Allocated memory was 343.9 MB in the beginning and 1.1 GB in the end (delta: 725.6 MB). Free memory was 224.6 MB in the beginning and 925.8 MB in the end (delta: -701.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 16.0 GB. [2021-06-05 10:29:18,672 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory was 324.6 MB in the beginning and 324.6 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 678.36 ms. Allocated memory is still 343.9 MB. Free memory was 304.5 MB in the beginning and 288.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 343.9 MB. Free memory was 288.5 MB in the beginning and 285.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.91 ms. Allocated memory is still 343.9 MB. Free memory was 285.4 MB in the beginning and 282.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 604.24 ms. Allocated memory is still 343.9 MB. Free memory was 282.3 MB in the beginning and 224.6 MB in the end (delta: 57.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19225.54 ms. Allocated memory was 343.9 MB in the beginning and 1.1 GB in the end (delta: 725.6 MB). Free memory was 224.6 MB in the beginning and 925.8 MB in the end (delta: -701.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={8:0}, t2={9:0}] [L1739] 0 return 0; VAL [t1={8:0}, t2={9:0}] [L1745] 0 int ret = my_drv_init(); VAL [t1={8:0}, t2={9:0}] [L1746] COND TRUE 0 ret==0 VAL [t1={8:0}, t2={9:0}] [L1747] 0 int probe_ret; VAL [t1={8:0}, t2={9:0}] [L1748] 0 struct my_data data; VAL [t1={8:0}, t2={9:0}] [L1706] 0 struct device *d = &data->dev; VAL [t1={8:0}, t2={9:0}] [L1708] 0 data->shared.a = 0 VAL [t1={8:0}, t2={9:0}] [L1709] 0 data->shared.b = 0 VAL [t1={8:0}, t2={9:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [t1={8:0}, t2={9:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [t1={8:0}, t2={9:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={10:24}, t1={8:0}, t2={9:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={10:24}, t1={8:0}, t2={9:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [arg={10:24}, arg={10:24}, dev={10:24}, t1={8:0}, t2={9:0}] [L1690] 2 struct my_data *data; VAL [arg={10:24}, arg={10:24}, dev={10:24}, t1={8:0}, t2={9:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, dev={10:24}, t1={8:0}, t2={9:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1715] 0 return 0; VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1749] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1750] COND TRUE 0 probe_ret==0 VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1721] 0 void *status; VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1722] 0 \read(t1) VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1690] 1 struct my_data *data; VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1694] 1 data->shared.a = 1 VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, t1={8:0}, t2={9:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [__mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1703] 1 return 0; VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] [L1730] 0 data->shared.a [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={10:24}, arg={10:24}, arg={10:24}, data={10:0}, dev={10:24}, lb=0, t1={8:0}, t2={9:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 163 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19056.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 97.8ms, AutomataDifference: 13406.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 228.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2983 SDtfs, 7919 SDslu, 16077 SDs, 0 SdLazy, 6118 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3425.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 31 SyntacticMatches, 18 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 11013.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8331occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1011.5ms AutomataMinimizationTime, 12 MinimizatonAttempts, 8350 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.7ms SsaConstructionTime, 278.6ms SatisfiabilityAnalysisTime, 3685.5ms InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 7386 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...