/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.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-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 20:01:04,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 20:01:04,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 20:01:04,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 20:01:04,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 20:01:04,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 20:01:04,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 20:01:04,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 20:01:04,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 20:01:04,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 20:01:04,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 20:01:04,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 20:01:04,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 20:01:04,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 20:01:04,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 20:01:04,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 20:01:04,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 20:01:04,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 20:01:04,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 20:01:04,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 20:01:04,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 20:01:04,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 20:01:04,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 20:01:04,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 20:01:04,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 20:01:04,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 20:01:04,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 20:01:04,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 20:01:04,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 20:01:04,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 20:01:04,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 20:01:04,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 20:01:04,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 20:01:04,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 20:01:04,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 20:01:04,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 20:01:04,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 20:01:04,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 20:01:04,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 20:01:04,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 20:01:04,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 20:01:04,869 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.epf [2021-06-05 20:01:04,903 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 20:01:04,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 20:01:04,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 20:01:04,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 20:01:04,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 20:01:04,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 20:01:04,907 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 20:01:04,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 20:01:04,907 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 20:01:04,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 20:01:04,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 20:01:04,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 20:01:04,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 20:01:04,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 20:01:04,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 20:01:04,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 20:01:04,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 20:01:04,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 20:01:04,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 20:01:04,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 20:01:04,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 20:01:04,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 20:01:04,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 20:01:04,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 20:01:04,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 20:01:04,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 20:01:04,911 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 20:01:05,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 20:01:05,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 20:01:05,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 20:01:05,301 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 20:01:05,301 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 20:01:05,302 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 20:01:05,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a3c9c39/80ea44b437fc46fd94fd65c22553274a/FLAG9573d64b3 [2021-06-05 20:01:05,970 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 20:01:05,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2021-06-05 20:01:05,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a3c9c39/80ea44b437fc46fd94fd65c22553274a/FLAG9573d64b3 [2021-06-05 20:01:06,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a3c9c39/80ea44b437fc46fd94fd65c22553274a [2021-06-05 20:01:06,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 20:01:06,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 20:01:06,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 20:01:06,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 20:01:06,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 20:01:06,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:01:06" (1/1) ... [2021-06-05 20:01:06,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc3486c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:06, skipping insertion in model container [2021-06-05 20:01:06,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:01:06" (1/1) ... [2021-06-05 20:01:06,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 20:01:06,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 20:01:06,464 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 20:01:07,058 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 20:01:07,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 20:01:07,100 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 20:01:07,110 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 20:01:07,140 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 20:01:07,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 20:01:07,427 INFO L208 MainTranslator]: Completed translation [2021-06-05 20:01:07,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07 WrapperNode [2021-06-05 20:01:07,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 20:01:07,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 20:01:07,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 20:01:07,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 20:01:07,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 20:01:07,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 20:01:07,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 20:01:07,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 20:01:07,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (1/1) ... [2021-06-05 20:01:07,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 20:01:07,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 20:01:07,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 20:01:07,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 20:01:07,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (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 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 20:01:07,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 20:01:07,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 20:01:07,622 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-06-05 20:01:07,622 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-06-05 20:01:07,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 20:01:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 20:01:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 20:01:07,629 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 20:01:08,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 20:01:08,194 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-06-05 20:01:08,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:01:08 BoogieIcfgContainer [2021-06-05 20:01:08,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 20:01:08,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 20:01:08,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 20:01:08,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 20:01:08,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:01:06" (1/3) ... [2021-06-05 20:01:08,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624528b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:01:08, skipping insertion in model container [2021-06-05 20:01:08,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:01:07" (2/3) ... [2021-06-05 20:01:08,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624528b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:01:08, skipping insertion in model container [2021-06-05 20:01:08,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:01:08" (3/3) ... [2021-06-05 20:01:08,203 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2021-06-05 20:01:08,209 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 20:01:08,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 20:01:08,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-06-05 20:01:08,210 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 20:01:08,255 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,255 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,255 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,256 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,262 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,269 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,271 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,272 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,278 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,279 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,280 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,280 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,281 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,282 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,285 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,286 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,287 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,288 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,291 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,291 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,292 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,293 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,294 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:01:08,306 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 20:01:08,341 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-05 20:01:08,363 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:01:08,363 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:01:08,363 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:01:08,363 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:01:08,363 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:01:08,364 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:01:08,364 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:01:08,364 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 20:01:08,380 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 155 transitions, 332 flow [2021-06-05 20:01:08,739 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 20:01:08,778 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 20:01:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 20:01:08,788 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:08,789 INFO L554 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 20:01:08,791 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 20:01:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1877077339, now seen corresponding path program 1 times [2021-06-05 20:01:08,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:08,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526663089] [2021-06-05 20:01:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:09,261 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 20:01:09,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:09,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526663089] [2021-06-05 20:01:09,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526663089] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:09,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:09,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:01:09,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656485645] [2021-06-05 20:01:09,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 20:01:09,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 20:01:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 20:01:09,306 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 20:01:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:09,814 INFO L93 Difference]: Finished difference Result 10982 states and 30392 transitions. [2021-06-05 20:01:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 20:01:09,815 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 20:01:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:09,874 INFO L225 Difference]: With dead ends: 10982 [2021-06-05 20:01:09,874 INFO L226 Difference]: Without dead ends: 9197 [2021-06-05 20:01:09,876 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 20:01:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9197 states. [2021-06-05 20:01:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9197 to 7212. [2021-06-05 20:01:10,163 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 20:01:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 19826 transitions. [2021-06-05 20:01:10,198 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 19826 transitions. Word has length 48 [2021-06-05 20:01:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:10,199 INFO L482 AbstractCegarLoop]: Abstraction has 7212 states and 19826 transitions. [2021-06-05 20:01:10,199 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 20:01:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 19826 transitions. [2021-06-05 20:01:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 20:01:10,202 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:10,203 INFO L554 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 20:01:10,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 20:01:10,203 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 20:01:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1490656626, now seen corresponding path program 1 times [2021-06-05 20:01:10,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:10,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334662303] [2021-06-05 20:01:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:10,374 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 20:01:10,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:10,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334662303] [2021-06-05 20:01:10,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334662303] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:10,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:10,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 20:01:10,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344194009] [2021-06-05 20:01:10,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 20:01:10,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 20:01:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 20:01:10,378 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 20:01:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:10,738 INFO L93 Difference]: Finished difference Result 9859 states and 26909 transitions. [2021-06-05 20:01:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 20:01:10,738 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 20:01:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:10,785 INFO L225 Difference]: With dead ends: 9859 [2021-06-05 20:01:10,785 INFO L226 Difference]: Without dead ends: 8378 [2021-06-05 20:01:10,786 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 20:01:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2021-06-05 20:01:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8114. [2021-06-05 20:01:10,967 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 20:01:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 22315 transitions. [2021-06-05 20:01:11,051 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 22315 transitions. Word has length 54 [2021-06-05 20:01:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:11,051 INFO L482 AbstractCegarLoop]: Abstraction has 8114 states and 22315 transitions. [2021-06-05 20:01:11,052 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 20:01:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 22315 transitions. [2021-06-05 20:01:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 20:01:11,060 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:11,060 INFO L554 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 20:01:11,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 20:01:11,061 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 20:01:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 867317945, now seen corresponding path program 1 times [2021-06-05 20:01:11,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:11,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215367659] [2021-06-05 20:01:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:11,184 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 20:01:11,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:11,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215367659] [2021-06-05 20:01:11,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215367659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:11,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:11,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 20:01:11,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660481978] [2021-06-05 20:01:11,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 20:01:11,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 20:01:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 20:01:11,188 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 20:01:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:11,232 INFO L93 Difference]: Finished difference Result 3194 states and 8459 transitions. [2021-06-05 20:01:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 20:01:11,233 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 20:01:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:11,240 INFO L225 Difference]: With dead ends: 3194 [2021-06-05 20:01:11,240 INFO L226 Difference]: Without dead ends: 3194 [2021-06-05 20:01:11,241 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 20:01:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-06-05 20:01:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2021-06-05 20:01:11,362 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 20:01:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 8459 transitions. [2021-06-05 20:01:11,371 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 8459 transitions. Word has length 68 [2021-06-05 20:01:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:11,372 INFO L482 AbstractCegarLoop]: Abstraction has 3194 states and 8459 transitions. [2021-06-05 20:01:11,372 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 20:01:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 8459 transitions. [2021-06-05 20:01:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 20:01:11,379 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:11,379 INFO L554 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 20:01:11,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 20:01:11,379 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 20:01:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1859350192, now seen corresponding path program 1 times [2021-06-05 20:01:11,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:11,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785099701] [2021-06-05 20:01:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:11,470 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 20:01:11,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:11,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785099701] [2021-06-05 20:01:11,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785099701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:11,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:11,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 20:01:11,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728562441] [2021-06-05 20:01:11,472 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:01:11,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:11,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:01:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:01:11,473 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 20:01:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:11,550 INFO L93 Difference]: Finished difference Result 3251 states and 8550 transitions. [2021-06-05 20:01:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:01:11,551 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 20:01:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:11,558 INFO L225 Difference]: With dead ends: 3251 [2021-06-05 20:01:11,558 INFO L226 Difference]: Without dead ends: 3251 [2021-06-05 20:01:11,559 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:01:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2021-06-05 20:01:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3202. [2021-06-05 20:01:11,646 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 20:01:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 8471 transitions. [2021-06-05 20:01:11,655 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 8471 transitions. Word has length 77 [2021-06-05 20:01:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:11,655 INFO L482 AbstractCegarLoop]: Abstraction has 3202 states and 8471 transitions. [2021-06-05 20:01:11,656 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 20:01:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 8471 transitions. [2021-06-05 20:01:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 20:01:11,664 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:11,664 INFO L554 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 20:01:11,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 20:01:11,664 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 20:01:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1805281448, now seen corresponding path program 1 times [2021-06-05 20:01:11,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:11,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866778797] [2021-06-05 20:01:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:11,782 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 20:01:11,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:11,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866778797] [2021-06-05 20:01:11,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866778797] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:11,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:11,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 20:01:11,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767642273] [2021-06-05 20:01:11,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:01:11,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:01:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:01:11,786 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 20:01:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:11,857 INFO L93 Difference]: Finished difference Result 3247 states and 8540 transitions. [2021-06-05 20:01:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:01:11,857 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 20:01:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:11,865 INFO L225 Difference]: With dead ends: 3247 [2021-06-05 20:01:11,865 INFO L226 Difference]: Without dead ends: 3247 [2021-06-05 20:01:11,866 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:01:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-06-05 20:01:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3210. [2021-06-05 20:01:11,930 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 20:01:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 8495 transitions. [2021-06-05 20:01:11,939 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 8495 transitions. Word has length 78 [2021-06-05 20:01:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:11,940 INFO L482 AbstractCegarLoop]: Abstraction has 3210 states and 8495 transitions. [2021-06-05 20:01:11,940 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 20:01:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 8495 transitions. [2021-06-05 20:01:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:11,947 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:11,948 INFO L554 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 20:01:11,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 20:01:11,948 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 20:01:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:11,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1156921516, now seen corresponding path program 1 times [2021-06-05 20:01:11,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:11,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613234624] [2021-06-05 20:01:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:12,740 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 20:01:12,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:12,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613234624] [2021-06-05 20:01:12,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613234624] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:12,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:12,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:12,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265152523] [2021-06-05 20:01:12,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:12,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:12,744 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 20:01:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:14,686 INFO L93 Difference]: Finished difference Result 3252 states and 8568 transitions. [2021-06-05 20:01:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 20:01:14,687 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 20:01:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:14,694 INFO L225 Difference]: With dead ends: 3252 [2021-06-05 20:01:14,694 INFO L226 Difference]: Without dead ends: 3252 [2021-06-05 20:01:14,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1435.9ms TimeCoverageRelationStatistics Valid=540, Invalid=1622, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 20:01:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2021-06-05 20:01:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3210. [2021-06-05 20:01:14,771 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 20:01:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 8487 transitions. [2021-06-05 20:01:14,780 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 8487 transitions. Word has length 85 [2021-06-05 20:01:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:14,781 INFO L482 AbstractCegarLoop]: Abstraction has 3210 states and 8487 transitions. [2021-06-05 20:01:14,781 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 20:01:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 8487 transitions. [2021-06-05 20:01:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:14,789 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:14,789 INFO L554 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 20:01:14,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 20:01:14,789 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 20:01:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1271700082, now seen corresponding path program 1 times [2021-06-05 20:01:14,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:14,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293000888] [2021-06-05 20:01:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:15,709 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 20:01:15,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:15,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293000888] [2021-06-05 20:01:15,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293000888] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:15,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:15,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:15,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697649666] [2021-06-05 20:01:15,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:15,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:15,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:15,712 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 20:01:17,020 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2021-06-05 20:01:17,202 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 20:01:17,410 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 20:01:17,626 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 20:01:17,850 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 20:01:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:18,059 INFO L93 Difference]: Finished difference Result 4001 states and 10490 transitions. [2021-06-05 20:01:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 20:01:18,060 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 20:01:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:18,068 INFO L225 Difference]: With dead ends: 4001 [2021-06-05 20:01:18,069 INFO L226 Difference]: Without dead ends: 4001 [2021-06-05 20:01:18,069 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2109.6ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 20:01:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2021-06-05 20:01:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 3310. [2021-06-05 20:01:18,143 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 20:01:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 8742 transitions. [2021-06-05 20:01:18,150 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 8742 transitions. Word has length 85 [2021-06-05 20:01:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:18,151 INFO L482 AbstractCegarLoop]: Abstraction has 3310 states and 8742 transitions. [2021-06-05 20:01:18,151 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 20:01:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 8742 transitions. [2021-06-05 20:01:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:18,158 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:18,159 INFO L554 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 20:01:18,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 20:01:18,159 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 20:01:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1892323956, now seen corresponding path program 2 times [2021-06-05 20:01:18,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:18,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634035817] [2021-06-05 20:01:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:18,865 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 20:01:18,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:18,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634035817] [2021-06-05 20:01:18,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634035817] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:18,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:18,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:18,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450981419] [2021-06-05 20:01:18,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:18,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:18,867 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 20:01:19,651 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-06-05 20:01:20,076 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 20:01:20,240 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 20:01:20,443 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 20:01:20,655 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 20:01:20,911 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 20:01:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:21,082 INFO L93 Difference]: Finished difference Result 4446 states and 11675 transitions. [2021-06-05 20:01:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 20:01:21,082 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 20:01:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:21,091 INFO L225 Difference]: With dead ends: 4446 [2021-06-05 20:01:21,091 INFO L226 Difference]: Without dead ends: 4446 [2021-06-05 20:01:21,091 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1989.3ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 20:01:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2021-06-05 20:01:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 3340. [2021-06-05 20:01:21,159 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 20:01:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 8832 transitions. [2021-06-05 20:01:21,166 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 8832 transitions. Word has length 85 [2021-06-05 20:01:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:21,166 INFO L482 AbstractCegarLoop]: Abstraction has 3340 states and 8832 transitions. [2021-06-05 20:01:21,166 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 20:01:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 8832 transitions. [2021-06-05 20:01:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:21,173 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:21,173 INFO L554 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 20:01:21,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 20:01:21,174 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 20:01:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1320862102, now seen corresponding path program 3 times [2021-06-05 20:01:21,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:21,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485780134] [2021-06-05 20:01:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:21,798 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 20:01:21,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:21,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485780134] [2021-06-05 20:01:21,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485780134] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:21,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:21,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:21,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093386327] [2021-06-05 20:01:21,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:21,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:21,801 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 20:01:22,286 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 20:01:22,944 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 20:01:23,105 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 20:01:23,330 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 20:01:23,574 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 20:01:23,813 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 20:01:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:23,981 INFO L93 Difference]: Finished difference Result 4401 states and 11555 transitions. [2021-06-05 20:01:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 20:01:23,981 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 20:01:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:23,989 INFO L225 Difference]: With dead ends: 4401 [2021-06-05 20:01:23,990 INFO L226 Difference]: Without dead ends: 4401 [2021-06-05 20:01:23,990 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1903.2ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 20:01:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2021-06-05 20:01:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3350. [2021-06-05 20:01:24,072 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 20:01:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 8862 transitions. [2021-06-05 20:01:24,080 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 8862 transitions. Word has length 85 [2021-06-05 20:01:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:24,080 INFO L482 AbstractCegarLoop]: Abstraction has 3350 states and 8862 transitions. [2021-06-05 20:01:24,080 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 20:01:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 8862 transitions. [2021-06-05 20:01:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:24,088 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:24,088 INFO L554 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 20:01:24,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 20:01:24,088 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 20:01:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash 8835666, now seen corresponding path program 4 times [2021-06-05 20:01:24,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:24,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926716358] [2021-06-05 20:01:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:24,727 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 20:01:24,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:24,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926716358] [2021-06-05 20:01:24,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926716358] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:24,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:24,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:24,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303366440] [2021-06-05 20:01:24,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:24,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:24,729 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 20:01:25,442 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-06-05 20:01:25,859 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 20:01:26,021 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 20:01:26,230 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 20:01:26,448 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 20:01:26,715 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 20:01:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:26,814 INFO L93 Difference]: Finished difference Result 4141 states and 10840 transitions. [2021-06-05 20:01:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 20:01:26,814 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 20:01:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:26,820 INFO L225 Difference]: With dead ends: 4141 [2021-06-05 20:01:26,820 INFO L226 Difference]: Without dead ends: 4141 [2021-06-05 20:01:26,821 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1873.5ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 20:01:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2021-06-05 20:01:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3360. [2021-06-05 20:01:26,888 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 20:01:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 8882 transitions. [2021-06-05 20:01:26,896 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 8882 transitions. Word has length 85 [2021-06-05 20:01:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:26,897 INFO L482 AbstractCegarLoop]: Abstraction has 3360 states and 8882 transitions. [2021-06-05 20:01:26,897 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 20:01:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 8882 transitions. [2021-06-05 20:01:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:26,904 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:26,904 INFO L554 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 20:01:26,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 20:01:26,904 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 20:01:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 748608168, now seen corresponding path program 5 times [2021-06-05 20:01:26,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:26,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413982246] [2021-06-05 20:01:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:27,412 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 20:01:27,413 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:27,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413982246] [2021-06-05 20:01:27,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413982246] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:27,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:27,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 20:01:27,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112543722] [2021-06-05 20:01:27,414 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 20:01:27,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:27,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 20:01:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 20:01:27,415 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 20:01:28,186 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-06-05 20:01:28,332 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-06-05 20:01:28,536 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-05 20:01:28,739 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-06-05 20:01:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:28,852 INFO L93 Difference]: Finished difference Result 3998 states and 10541 transitions. [2021-06-05 20:01:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 20:01:28,869 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 20:01:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:28,875 INFO L225 Difference]: With dead ends: 3998 [2021-06-05 20:01:28,875 INFO L226 Difference]: Without dead ends: 3998 [2021-06-05 20:01:28,876 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1379.7ms TimeCoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2021-06-05 20:01:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2021-06-05 20:01:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3560. [2021-06-05 20:01:28,941 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 20:01:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 9442 transitions. [2021-06-05 20:01:28,948 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 9442 transitions. Word has length 85 [2021-06-05 20:01:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:28,949 INFO L482 AbstractCegarLoop]: Abstraction has 3560 states and 9442 transitions. [2021-06-05 20:01:28,949 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 20:01:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 9442 transitions. [2021-06-05 20:01:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:28,956 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:28,956 INFO L554 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 20:01:28,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 20:01:28,956 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 20:01:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash -915711888, now seen corresponding path program 6 times [2021-06-05 20:01:28,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:28,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587218713] [2021-06-05 20:01:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:01:29,579 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 20:01:29,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:01:29,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587218713] [2021-06-05 20:01:29,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587218713] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:01:29,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:01:29,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 20:01:29,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232757787] [2021-06-05 20:01:29,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 20:01:29,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:01:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 20:01:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 20:01:29,582 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 20:01:30,603 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2021-06-05 20:01:30,755 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 20:01:30,962 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 20:01:31,162 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-06-05 20:01:31,372 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2021-06-05 20:01:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:01:31,581 INFO L93 Difference]: Finished difference Result 5504 states and 13915 transitions. [2021-06-05 20:01:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 20:01:31,581 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 20:01:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:01:31,588 INFO L225 Difference]: With dead ends: 5504 [2021-06-05 20:01:31,588 INFO L226 Difference]: Without dead ends: 5504 [2021-06-05 20:01:31,589 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1862.9ms TimeCoverageRelationStatistics Valid=350, Invalid=840, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 20:01:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2021-06-05 20:01:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 3598. [2021-06-05 20:01:31,666 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 20:01:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 9524 transitions. [2021-06-05 20:01:31,674 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 9524 transitions. Word has length 85 [2021-06-05 20:01:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:01:31,674 INFO L482 AbstractCegarLoop]: Abstraction has 3598 states and 9524 transitions. [2021-06-05 20:01:31,674 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 20:01:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 9524 transitions. [2021-06-05 20:01:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 20:01:31,681 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:01:31,681 INFO L554 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 20:01:31,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 20:01:31,681 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 20:01:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:01:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash 970805360, now seen corresponding path program 7 times [2021-06-05 20:01:31,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:01:31,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076388083] [2021-06-05 20:01:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:01:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:01:31,716 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:01:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:01:31,748 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:01:31,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 20:01:31,793 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 20:01:31,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 20:01:31,796 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 20:01:31,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:01:31 BasicIcfg [2021-06-05 20:01:31,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 20:01:31,884 INFO L168 Benchmark]: Toolchain (without parser) took 25662.79 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 889.2 MB). Free memory was 359.2 MB in the beginning and 563.0 MB in the end (delta: -203.9 MB). Peak memory consumption was 688.2 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,884 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 398.5 MB. Free memory was 379.2 MB in the beginning and 379.1 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 20:01:31,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1202.57 ms. Allocated memory is still 398.5 MB. Free memory was 359.0 MB in the beginning and 346.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 81.1 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.64 ms. Allocated memory is still 398.5 MB. Free memory was 346.8 MB in the beginning and 342.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,884 INFO L168 Benchmark]: Boogie Preprocessor took 45.66 ms. Allocated memory is still 398.5 MB. Free memory was 342.7 MB in the beginning and 340.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,885 INFO L168 Benchmark]: RCFGBuilder took 651.75 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 282.9 MB in the end (delta: 57.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,885 INFO L168 Benchmark]: TraceAbstraction took 23685.88 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 889.2 MB). Free memory was 281.9 MB in the beginning and 563.0 MB in the end (delta: -281.2 MB). Peak memory consumption was 608.0 MB. Max. memory is 16.0 GB. [2021-06-05 20:01:31,885 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.17 ms. Allocated memory is still 398.5 MB. Free memory was 379.2 MB in the beginning and 379.1 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1202.57 ms. Allocated memory is still 398.5 MB. Free memory was 359.0 MB in the beginning and 346.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 81.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.64 ms. Allocated memory is still 398.5 MB. Free memory was 346.8 MB in the beginning and 342.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.66 ms. Allocated memory is still 398.5 MB. Free memory was 342.7 MB in the beginning and 340.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 651.75 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 282.9 MB in the end (delta: 57.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23685.88 ms. Allocated memory was 398.5 MB in the beginning and 1.3 GB in the end (delta: 889.2 MB). Free memory was 281.9 MB in the beginning and 563.0 MB in the end (delta: -281.2 MB). Peak memory consumption was 608.0 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 163 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23433.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 131.3ms, AutomataDifference: 15525.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 375.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2983 SDtfs, 8000 SDslu, 15884 SDs, 0 SdLazy, 5899 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3884.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 31 SyntacticMatches, 18 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 12778.1ms 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: 1436.7ms AutomataMinimizationTime, 12 MinimizatonAttempts, 8350 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.8ms SsaConstructionTime, 451.8ms SatisfiabilityAnalysisTime, 5026.8ms InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 7390 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...