/usr/bin/java -Xmx8000000000 -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/pthread-wmm/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:49:27,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:49:27,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:49:27,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:49:27,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:49:27,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:49:27,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:49:27,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:49:27,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:49:27,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:49:27,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:49:27,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:49:27,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:49:27,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:49:27,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:49:27,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:49:27,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:49:27,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:49:27,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:49:27,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:49:27,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:49:27,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:49:27,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:49:27,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:49:27,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:49:27,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:49:27,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:49:27,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:49:27,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:49:27,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:49:27,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:49:27,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:49:27,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:49:27,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:49:27,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:49:27,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:49:27,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:49:27,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:49:27,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:49:27,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:49:27,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:49:27,111 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-08-06 13:49:27,141 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:49:27,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:49:27,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:49:27,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:49:27,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:49:27,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:49:27,144 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:49:27,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:49:27,144 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:49:27,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:49:27,145 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:49:27,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:49:27,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:49:27,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:49:27,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:49:27,147 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:49:27,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:49:27,147 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-08-06 13:49:27,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:49:27,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:49:27,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:49:27,430 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:49:27,431 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:49:27,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-08-06 13:49:27,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa0727be/f062ad11cdac46a1a0272c417935390c/FLAG510e40c3f [2021-08-06 13:49:27,934 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:49:27,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2021-08-06 13:49:27,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa0727be/f062ad11cdac46a1a0272c417935390c/FLAG510e40c3f [2021-08-06 13:49:28,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa0727be/f062ad11cdac46a1a0272c417935390c [2021-08-06 13:49:28,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:49:28,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:49:28,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:49:28,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:49:28,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:49:28,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d68f69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28, skipping insertion in model container [2021-08-06 13:49:28,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:49:28,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:49:28,406 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i[949,962] [2021-08-06 13:49:28,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:49:28,617 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:49:28,632 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i[949,962] [2021-08-06 13:49:28,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:49:28,695 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:49:28,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28 WrapperNode [2021-08-06 13:49:28,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:49:28,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:49:28,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:49:28,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:49:28,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:49:28,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:49:28,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:49:28,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:49:28,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:49:28,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:49:28,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:49:28,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:49:28,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (1/1) ... [2021-08-06 13:49:28,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:49:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:49:28,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-06 13:49:28,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-06 13:49:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:49:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 13:49:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:49:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:49:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 13:49:28,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 13:49:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 13:49:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 13:49:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 13:49:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 13:49:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:49:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 13:49:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:49:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:49:28,873 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:49:30,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:49:30,242 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 13:49:30,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:49:30 BoogieIcfgContainer [2021-08-06 13:49:30,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:49:30,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:49:30,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:49:30,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:49:30,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:49:28" (1/3) ... [2021-08-06 13:49:30,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cf60a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:49:30, skipping insertion in model container [2021-08-06 13:49:30,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:49:28" (2/3) ... [2021-08-06 13:49:30,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cf60a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:49:30, skipping insertion in model container [2021-08-06 13:49:30,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:49:30" (3/3) ... [2021-08-06 13:49:30,252 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-08-06 13:49:30,255 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:49:30,256 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:49:30,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 13:49:30,256 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,294 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:49:30,332 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 13:49:30,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:49:30,365 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 13:49:30,366 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 13:49:30,375 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-08-06 13:49:30,601 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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-08-06 13:49:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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-08-06 13:49:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-06 13:49:30,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:30,670 INFO L512 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] [2021-08-06 13:49:30,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -54479379, now seen corresponding path program 1 times [2021-08-06 13:49:30,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:30,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450037383] [2021-08-06 13:49:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:30,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:31,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:31,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450037383] [2021-08-06 13:49:31,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450037383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:31,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:31,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:49:31,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267171042] [2021-08-06 13:49:31,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:49:31,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:49:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:49:31,252 INFO L87 Difference]: Start difference. First operand has 8606 states, 8604 states have (on average 3.5527661552766157) internal successors, (30568), 8605 states have internal predecessors, (30568), 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 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-08-06 13:49:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:31,784 INFO L93 Difference]: Finished difference Result 10352 states and 35825 transitions. [2021-08-06 13:49:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:49:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2021-08-06 13:49:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:31,849 INFO L225 Difference]: With dead ends: 10352 [2021-08-06 13:49:31,849 INFO L226 Difference]: Without dead ends: 7832 [2021-08-06 13:49:31,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 170.3ms TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:49:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2021-08-06 13:49:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 7832. [2021-08-06 13:49:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7832 states, 7830 states have (on average 3.468582375478927) internal successors, (27159), 7831 states have internal predecessors, (27159), 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-08-06 13:49:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7832 states to 7832 states and 27159 transitions. [2021-08-06 13:49:32,185 INFO L78 Accepts]: Start accepts. Automaton has 7832 states and 27159 transitions. Word has length 66 [2021-08-06 13:49:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:32,186 INFO L470 AbstractCegarLoop]: Abstraction has 7832 states and 27159 transitions. [2021-08-06 13:49:32,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-08-06 13:49:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7832 states and 27159 transitions. [2021-08-06 13:49:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 13:49:32,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:32,199 INFO L512 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] [2021-08-06 13:49:32,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:49:32,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash 691255607, now seen corresponding path program 1 times [2021-08-06 13:49:32,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:32,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222989627] [2021-08-06 13:49:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:32,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:32,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:32,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222989627] [2021-08-06 13:49:32,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222989627] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:32,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:32,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:49:32,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695966677] [2021-08-06 13:49:32,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:49:32,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:49:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:49:32,439 INFO L87 Difference]: Start difference. First operand 7832 states and 27159 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08-06 13:49:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:32,603 INFO L93 Difference]: Finished difference Result 8792 states and 30199 transitions. [2021-08-06 13:49:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:49:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2021-08-06 13:49:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:32,660 INFO L225 Difference]: With dead ends: 8792 [2021-08-06 13:49:32,660 INFO L226 Difference]: Without dead ends: 7256 [2021-08-06 13:49:32,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:49:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2021-08-06 13:49:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 7256. [2021-08-06 13:49:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7256 states, 7254 states have (on average 3.4528535980148884) internal successors, (25047), 7255 states have internal predecessors, (25047), 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-08-06 13:49:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 25047 transitions. [2021-08-06 13:49:32,896 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 25047 transitions. Word has length 69 [2021-08-06 13:49:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:32,898 INFO L470 AbstractCegarLoop]: Abstraction has 7256 states and 25047 transitions. [2021-08-06 13:49:32,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08-06 13:49:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 25047 transitions. [2021-08-06 13:49:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 13:49:32,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:32,910 INFO L512 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] [2021-08-06 13:49:32,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:49:32,910 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1078700675, now seen corresponding path program 1 times [2021-08-06 13:49:32,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:32,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321839381] [2021-08-06 13:49:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:32,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:33,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:33,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321839381] [2021-08-06 13:49:33,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321839381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:33,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:33,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:49:33,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522583013] [2021-08-06 13:49:33,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:49:33,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:33,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:49:33,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:49:33,136 INFO L87 Difference]: Start difference. First operand 7256 states and 25047 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-08-06 13:49:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:33,315 INFO L93 Difference]: Finished difference Result 11438 states and 39498 transitions. [2021-08-06 13:49:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:49:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2021-08-06 13:49:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:33,339 INFO L225 Difference]: With dead ends: 11438 [2021-08-06 13:49:33,339 INFO L226 Difference]: Without dead ends: 6584 [2021-08-06 13:49:33,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 134.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:49:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2021-08-06 13:49:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6584. [2021-08-06 13:49:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6582 states have (on average 3.411577028258888) internal successors, (22455), 6583 states have internal predecessors, (22455), 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-08-06 13:49:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 22455 transitions. [2021-08-06 13:49:33,584 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 22455 transitions. Word has length 69 [2021-08-06 13:49:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:33,585 INFO L470 AbstractCegarLoop]: Abstraction has 6584 states and 22455 transitions. [2021-08-06 13:49:33,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-08-06 13:49:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 22455 transitions. [2021-08-06 13:49:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 13:49:33,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:33,597 INFO L512 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] [2021-08-06 13:49:33,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:49:33,597 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash -702147978, now seen corresponding path program 1 times [2021-08-06 13:49:33,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:33,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125018836] [2021-08-06 13:49:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:33,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:33,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:33,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125018836] [2021-08-06 13:49:33,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125018836] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:33,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:33,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:49:33,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513268358] [2021-08-06 13:49:33,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:49:33,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:49:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:49:33,818 INFO L87 Difference]: Start difference. First operand 6584 states and 22455 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-08-06 13:49:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:34,211 INFO L93 Difference]: Finished difference Result 7831 states and 26387 transitions. [2021-08-06 13:49:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-06 13:49:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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 71 [2021-08-06 13:49:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:34,236 INFO L225 Difference]: With dead ends: 7831 [2021-08-06 13:49:34,237 INFO L226 Difference]: Without dead ends: 6967 [2021-08-06 13:49:34,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 184.0ms TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:49:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6967 states. [2021-08-06 13:49:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6967 to 6536. [2021-08-06 13:49:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6536 states, 6534 states have (on average 3.4054178145087235) internal successors, (22251), 6535 states have internal predecessors, (22251), 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-08-06 13:49:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 22251 transitions. [2021-08-06 13:49:34,483 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 22251 transitions. Word has length 71 [2021-08-06 13:49:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:34,483 INFO L470 AbstractCegarLoop]: Abstraction has 6536 states and 22251 transitions. [2021-08-06 13:49:34,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-08-06 13:49:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 22251 transitions. [2021-08-06 13:49:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 13:49:34,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:34,495 INFO L512 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] [2021-08-06 13:49:34,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:49:34,495 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1417891492, now seen corresponding path program 1 times [2021-08-06 13:49:34,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:34,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979939723] [2021-08-06 13:49:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:34,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:34,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:34,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979939723] [2021-08-06 13:49:34,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979939723] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:34,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:34,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:49:34,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401748793] [2021-08-06 13:49:34,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:49:34,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:49:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:49:34,643 INFO L87 Difference]: Start difference. First operand 6536 states and 22251 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-08-06 13:49:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:34,949 INFO L93 Difference]: Finished difference Result 6802 states and 23002 transitions. [2021-08-06 13:49:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:49:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 71 [2021-08-06 13:49:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:34,968 INFO L225 Difference]: With dead ends: 6802 [2021-08-06 13:49:34,969 INFO L226 Difference]: Without dead ends: 5970 [2021-08-06 13:49:34,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 156.6ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:49:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2021-08-06 13:49:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 5970. [2021-08-06 13:49:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5970 states, 5969 states have (on average 3.400904674149774) internal successors, (20300), 5969 states have internal predecessors, (20300), 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-08-06 13:49:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5970 states to 5970 states and 20300 transitions. [2021-08-06 13:49:35,160 INFO L78 Accepts]: Start accepts. Automaton has 5970 states and 20300 transitions. Word has length 71 [2021-08-06 13:49:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:35,160 INFO L470 AbstractCegarLoop]: Abstraction has 5970 states and 20300 transitions. [2021-08-06 13:49:35,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-08-06 13:49:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5970 states and 20300 transitions. [2021-08-06 13:49:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 13:49:35,174 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:35,175 INFO L512 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] [2021-08-06 13:49:35,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:49:35,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1388300055, now seen corresponding path program 1 times [2021-08-06 13:49:35,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:35,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112204497] [2021-08-06 13:49:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:35,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:35,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:35,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112204497] [2021-08-06 13:49:35,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112204497] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:35,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:35,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:49:35,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959816594] [2021-08-06 13:49:35,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:49:35,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:49:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:49:35,260 INFO L87 Difference]: Start difference. First operand 5970 states and 20300 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-08-06 13:49:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:35,452 INFO L93 Difference]: Finished difference Result 13187 states and 44323 transitions. [2021-08-06 13:49:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 13:49:35,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2021-08-06 13:49:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:35,469 INFO L225 Difference]: With dead ends: 13187 [2021-08-06 13:49:35,470 INFO L226 Difference]: Without dead ends: 5952 [2021-08-06 13:49:35,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 107.3ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-08-06 13:49:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2021-08-06 13:49:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 5082. [2021-08-06 13:49:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5082 states, 5081 states have (on average 3.2775044282621533) internal successors, (16653), 5081 states have internal predecessors, (16653), 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-08-06 13:49:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5082 states to 5082 states and 16653 transitions. [2021-08-06 13:49:35,650 INFO L78 Accepts]: Start accepts. Automaton has 5082 states and 16653 transitions. Word has length 72 [2021-08-06 13:49:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:35,651 INFO L470 AbstractCegarLoop]: Abstraction has 5082 states and 16653 transitions. [2021-08-06 13:49:35,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-08-06 13:49:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5082 states and 16653 transitions. [2021-08-06 13:49:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 13:49:35,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:35,659 INFO L512 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] [2021-08-06 13:49:35,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:49:35,659 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1851596438, now seen corresponding path program 1 times [2021-08-06 13:49:35,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:35,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765157068] [2021-08-06 13:49:35,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:35,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:35,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:35,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765157068] [2021-08-06 13:49:35,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765157068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:35,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:35,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:49:35,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237322878] [2021-08-06 13:49:35,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:49:35,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:49:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:49:35,853 INFO L87 Difference]: Start difference. First operand 5082 states and 16653 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-08-06 13:49:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:36,168 INFO L93 Difference]: Finished difference Result 6090 states and 19937 transitions. [2021-08-06 13:49:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-06 13:49:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 72 [2021-08-06 13:49:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:36,183 INFO L225 Difference]: With dead ends: 6090 [2021-08-06 13:49:36,184 INFO L226 Difference]: Without dead ends: 5322 [2021-08-06 13:49:36,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 193.3ms TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2021-08-06 13:49:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2021-08-06 13:49:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5322. [2021-08-06 13:49:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5322 states, 5321 states have (on average 3.2792708137568125) internal successors, (17449), 5321 states have internal predecessors, (17449), 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-08-06 13:49:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5322 states to 5322 states and 17449 transitions. [2021-08-06 13:49:36,311 INFO L78 Accepts]: Start accepts. Automaton has 5322 states and 17449 transitions. Word has length 72 [2021-08-06 13:49:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:36,311 INFO L470 AbstractCegarLoop]: Abstraction has 5322 states and 17449 transitions. [2021-08-06 13:49:36,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-08-06 13:49:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 17449 transitions. [2021-08-06 13:49:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 13:49:36,321 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:36,322 INFO L512 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] [2021-08-06 13:49:36,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:49:36,322 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1166366895, now seen corresponding path program 1 times [2021-08-06 13:49:36,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:36,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574541323] [2021-08-06 13:49:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:36,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:36,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:36,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574541323] [2021-08-06 13:49:36,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574541323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:36,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:36,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 13:49:36,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654256199] [2021-08-06 13:49:36,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 13:49:36,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 13:49:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:49:36,542 INFO L87 Difference]: Start difference. First operand 5322 states and 17449 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-08-06 13:49:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:36,997 INFO L93 Difference]: Finished difference Result 6554 states and 21496 transitions. [2021-08-06 13:49:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-06 13:49:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 72 [2021-08-06 13:49:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:37,010 INFO L225 Difference]: With dead ends: 6554 [2021-08-06 13:49:37,010 INFO L226 Difference]: Without dead ends: 5682 [2021-08-06 13:49:37,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 269.9ms TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2021-08-06 13:49:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2021-08-06 13:49:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 5514. [2021-08-06 13:49:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 5513 states have (on average 3.2769816796662434) internal successors, (18066), 5513 states have internal predecessors, (18066), 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-08-06 13:49:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 18066 transitions. [2021-08-06 13:49:37,222 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 18066 transitions. Word has length 72 [2021-08-06 13:49:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:37,223 INFO L470 AbstractCegarLoop]: Abstraction has 5514 states and 18066 transitions. [2021-08-06 13:49:37,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-08-06 13:49:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 18066 transitions. [2021-08-06 13:49:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:49:37,232 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:37,232 INFO L512 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] [2021-08-06 13:49:37,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:49:37,233 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1196316248, now seen corresponding path program 1 times [2021-08-06 13:49:37,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:37,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636496077] [2021-08-06 13:49:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:37,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:37,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:37,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636496077] [2021-08-06 13:49:37,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636496077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:37,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:37,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:49:37,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960181301] [2021-08-06 13:49:37,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:49:37,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:49:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:49:37,479 INFO L87 Difference]: Start difference. First operand 5514 states and 18066 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-08-06 13:49:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:37,689 INFO L93 Difference]: Finished difference Result 6042 states and 19718 transitions. [2021-08-06 13:49:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 13:49:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 73 [2021-08-06 13:49:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:37,703 INFO L225 Difference]: With dead ends: 6042 [2021-08-06 13:49:37,703 INFO L226 Difference]: Without dead ends: 5466 [2021-08-06 13:49:37,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 125.8ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:49:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2021-08-06 13:49:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2021-08-06 13:49:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5466 states, 5465 states have (on average 3.2728270814272644) internal successors, (17886), 5465 states have internal predecessors, (17886), 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-08-06 13:49:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 17886 transitions. [2021-08-06 13:49:37,931 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 17886 transitions. Word has length 73 [2021-08-06 13:49:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:37,931 INFO L470 AbstractCegarLoop]: Abstraction has 5466 states and 17886 transitions. [2021-08-06 13:49:37,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-08-06 13:49:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 17886 transitions. [2021-08-06 13:49:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:49:37,940 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:37,941 INFO L512 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] [2021-08-06 13:49:37,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:49:37,941 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 558722379, now seen corresponding path program 1 times [2021-08-06 13:49:37,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:37,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200904280] [2021-08-06 13:49:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:37,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:38,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:38,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200904280] [2021-08-06 13:49:38,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200904280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:38,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:38,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-06 13:49:38,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106886311] [2021-08-06 13:49:38,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-06 13:49:38,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-06 13:49:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:49:38,199 INFO L87 Difference]: Start difference. First operand 5466 states and 17886 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 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-08-06 13:49:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:38,455 INFO L93 Difference]: Finished difference Result 5786 states and 18846 transitions. [2021-08-06 13:49:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:49:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 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 73 [2021-08-06 13:49:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:38,467 INFO L225 Difference]: With dead ends: 5786 [2021-08-06 13:49:38,467 INFO L226 Difference]: Without dead ends: 5274 [2021-08-06 13:49:38,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 200.8ms TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-08-06 13:49:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2021-08-06 13:49:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 4914. [2021-08-06 13:49:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4913 states have (on average 3.251780989212294) internal successors, (15976), 4913 states have internal predecessors, (15976), 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-08-06 13:49:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 15976 transitions. [2021-08-06 13:49:38,590 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 15976 transitions. Word has length 73 [2021-08-06 13:49:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:38,590 INFO L470 AbstractCegarLoop]: Abstraction has 4914 states and 15976 transitions. [2021-08-06 13:49:38,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 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-08-06 13:49:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 15976 transitions. [2021-08-06 13:49:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 13:49:38,599 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:38,599 INFO L512 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] [2021-08-06 13:49:38,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:49:38,600 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1291858280, now seen corresponding path program 1 times [2021-08-06 13:49:38,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:38,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114248995] [2021-08-06 13:49:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:38,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:38,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:38,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114248995] [2021-08-06 13:49:38,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114248995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:38,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:38,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:49:38,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982324332] [2021-08-06 13:49:38,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:49:38,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:49:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:49:38,697 INFO L87 Difference]: Start difference. First operand 4914 states and 15976 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-08-06 13:49:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:38,787 INFO L93 Difference]: Finished difference Result 5918 states and 18936 transitions. [2021-08-06 13:49:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:49:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2021-08-06 13:49:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:38,797 INFO L225 Difference]: With dead ends: 5918 [2021-08-06 13:49:38,797 INFO L226 Difference]: Without dead ends: 4398 [2021-08-06 13:49:38,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 53.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:49:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2021-08-06 13:49:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4398. [2021-08-06 13:49:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 4397 states have (on average 3.192631339549693) internal successors, (14038), 4397 states have internal predecessors, (14038), 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-08-06 13:49:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 14038 transitions. [2021-08-06 13:49:38,896 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 14038 transitions. Word has length 74 [2021-08-06 13:49:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:38,896 INFO L470 AbstractCegarLoop]: Abstraction has 4398 states and 14038 transitions. [2021-08-06 13:49:38,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-08-06 13:49:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 14038 transitions. [2021-08-06 13:49:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 13:49:38,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:38,904 INFO L512 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] [2021-08-06 13:49:38,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:49:38,904 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash 410720810, now seen corresponding path program 1 times [2021-08-06 13:49:38,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:38,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546025659] [2021-08-06 13:49:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:38,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:38,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:38,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546025659] [2021-08-06 13:49:38,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546025659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:38,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:38,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:49:38,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928877388] [2021-08-06 13:49:38,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:49:38,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:49:38,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:49:38,987 INFO L87 Difference]: Start difference. First operand 4398 states and 14038 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-08-06 13:49:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:39,092 INFO L93 Difference]: Finished difference Result 4308 states and 13360 transitions. [2021-08-06 13:49:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:49:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2021-08-06 13:49:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:39,125 INFO L225 Difference]: With dead ends: 4308 [2021-08-06 13:49:39,125 INFO L226 Difference]: Without dead ends: 3084 [2021-08-06 13:49:39,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:49:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2021-08-06 13:49:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3048. [2021-08-06 13:49:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 3.048572366261897) internal successors, (9289), 3047 states have internal predecessors, (9289), 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-08-06 13:49:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 9289 transitions. [2021-08-06 13:49:39,173 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 9289 transitions. Word has length 75 [2021-08-06 13:49:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:39,173 INFO L470 AbstractCegarLoop]: Abstraction has 3048 states and 9289 transitions. [2021-08-06 13:49:39,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-08-06 13:49:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 9289 transitions. [2021-08-06 13:49:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:49:39,180 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:39,180 INFO L512 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-08-06 13:49:39,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:49:39,180 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:39,181 INFO L82 PathProgramCache]: Analyzing trace with hash -987755541, now seen corresponding path program 1 times [2021-08-06 13:49:39,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:39,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785799373] [2021-08-06 13:49:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:39,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:39,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:39,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785799373] [2021-08-06 13:49:39,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785799373] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:39,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:39,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:49:39,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249366053] [2021-08-06 13:49:39,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:49:39,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:49:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:49:39,294 INFO L87 Difference]: Start difference. First operand 3048 states and 9289 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 13:49:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:39,398 INFO L93 Difference]: Finished difference Result 2490 states and 7384 transitions. [2021-08-06 13:49:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:49:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 13:49:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:39,401 INFO L225 Difference]: With dead ends: 2490 [2021-08-06 13:49:39,401 INFO L226 Difference]: Without dead ends: 1449 [2021-08-06 13:49:39,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:49:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2021-08-06 13:49:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1401. [2021-08-06 13:49:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 2.8785714285714286) internal successors, (4030), 1400 states have internal predecessors, (4030), 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-08-06 13:49:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4030 transitions. [2021-08-06 13:49:39,418 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4030 transitions. Word has length 77 [2021-08-06 13:49:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:39,418 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 4030 transitions. [2021-08-06 13:49:39,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 13:49:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4030 transitions. [2021-08-06 13:49:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 13:49:39,420 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:39,420 INFO L512 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] [2021-08-06 13:49:39,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:49:39,420 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash -533737277, now seen corresponding path program 1 times [2021-08-06 13:49:39,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:39,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187903033] [2021-08-06 13:49:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:39,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:39,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:39,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187903033] [2021-08-06 13:49:39,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187903033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:39,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:39,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 13:49:39,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408787608] [2021-08-06 13:49:39,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 13:49:39,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 13:49:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:49:39,596 INFO L87 Difference]: Start difference. First operand 1401 states and 4030 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-08-06 13:49:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:39,717 INFO L93 Difference]: Finished difference Result 2031 states and 5938 transitions. [2021-08-06 13:49:39,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:49:39,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 80 [2021-08-06 13:49:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:39,719 INFO L225 Difference]: With dead ends: 2031 [2021-08-06 13:49:39,720 INFO L226 Difference]: Without dead ends: 1265 [2021-08-06 13:49:39,720 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 91.4ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:49:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-08-06 13:49:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1145. [2021-08-06 13:49:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 2.7674825174825175) internal successors, (3166), 1144 states have internal predecessors, (3166), 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-08-06 13:49:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 3166 transitions. [2021-08-06 13:49:39,735 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 3166 transitions. Word has length 80 [2021-08-06 13:49:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:39,735 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 3166 transitions. [2021-08-06 13:49:39,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-08-06 13:49:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 3166 transitions. [2021-08-06 13:49:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 13:49:39,737 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:39,737 INFO L512 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] [2021-08-06 13:49:39,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 13:49:39,737 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1117837509, now seen corresponding path program 2 times [2021-08-06 13:49:39,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:39,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81874511] [2021-08-06 13:49:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:39,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:49:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:49:40,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:49:40,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81874511] [2021-08-06 13:49:40,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81874511] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:49:40,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:49:40,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:49:40,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599543321] [2021-08-06 13:49:40,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:49:40,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:49:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:49:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:49:40,009 INFO L87 Difference]: Start difference. First operand 1145 states and 3166 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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-08-06 13:49:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:49:40,233 INFO L93 Difference]: Finished difference Result 1715 states and 4881 transitions. [2021-08-06 13:49:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:49:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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 80 [2021-08-06 13:49:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:49:40,236 INFO L225 Difference]: With dead ends: 1715 [2021-08-06 13:49:40,236 INFO L226 Difference]: Without dead ends: 949 [2021-08-06 13:49:40,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 200.1ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:49:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-08-06 13:49:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2021-08-06 13:49:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.782700421940928) internal successors, (2638), 948 states have internal predecessors, (2638), 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-08-06 13:49:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2638 transitions. [2021-08-06 13:49:40,248 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2638 transitions. Word has length 80 [2021-08-06 13:49:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:49:40,248 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 2638 transitions. [2021-08-06 13:49:40,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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-08-06 13:49:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2638 transitions. [2021-08-06 13:49:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 13:49:40,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:49:40,250 INFO L512 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] [2021-08-06 13:49:40,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 13:49:40,250 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:49:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:49:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1612032835, now seen corresponding path program 3 times [2021-08-06 13:49:40,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:49:40,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60718591] [2021-08-06 13:49:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:49:40,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:49:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:49:40,277 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 13:49:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:49:40,332 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 13:49:40,332 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 13:49:40,333 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 13:49:40,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:49:40,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:49:40,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 13:49:40,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-06 13:49:40,337 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 13:49:40,339 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 13:49:40,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 13:49:40,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 01:49:40 BasicIcfg [2021-08-06 13:49:40,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 13:49:40,410 INFO L168 Benchmark]: Toolchain (without parser) took 12155.99 ms. Allocated memory was 223.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 186.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 711.0 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 223.3 MB. Free memory was 204.4 MB in the beginning and 204.3 MB in the end (delta: 88.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.99 ms. Allocated memory is still 223.3 MB. Free memory was 186.1 MB in the beginning and 192.8 MB in the end (delta: -6.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.55 ms. Allocated memory is still 223.3 MB. Free memory was 192.8 MB in the beginning and 190.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 ms. Allocated memory is still 223.3 MB. Free memory was 190.2 MB in the beginning and 187.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: RCFGBuilder took 1478.26 ms. Allocated memory is still 223.3 MB. Free memory was 187.6 MB in the beginning and 88.4 MB in the end (delta: 99.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 INFO L168 Benchmark]: TraceAbstraction took 10164.01 ms. Allocated memory was 223.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 87.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 611.8 MB. Max. memory is 8.0 GB. [2021-08-06 13:49:40,410 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.14 ms. Allocated memory is still 223.3 MB. Free memory was 204.4 MB in the beginning and 204.3 MB in the end (delta: 88.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 438.99 ms. Allocated memory is still 223.3 MB. Free memory was 186.1 MB in the beginning and 192.8 MB in the end (delta: -6.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 36.55 ms. Allocated memory is still 223.3 MB. Free memory was 192.8 MB in the beginning and 190.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.95 ms. Allocated memory is still 223.3 MB. Free memory was 190.2 MB in the beginning and 187.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1478.26 ms. Allocated memory is still 223.3 MB. Free memory was 187.6 MB in the beginning and 88.4 MB in the end (delta: 99.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10164.01 ms. Allocated memory was 223.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 87.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 611.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2192; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2193; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2194; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9977.4ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 191.7ms, AutomataDifference: 4011.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 235.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1967 SDtfs, 3663 SDslu, 8636 SDs, 0 SdLazy, 1306 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1122.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2101.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8606occurred in iteration=0, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2296.0ms AutomataMinimizationTime, 15 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.5ms SsaConstructionTime, 517.4ms SatisfiabilityAnalysisTime, 2414.3ms InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1079 ConstructedInterpolants, 0 QuantifiedInterpolants, 7450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-06 13:49:40,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...