/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 18:07:45,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 18:07:45,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 18:07:45,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 18:07:45,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 18:07:45,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 18:07:45,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 18:07:45,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 18:07:45,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 18:07:45,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 18:07:45,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 18:07:45,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 18:07:45,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 18:07:45,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 18:07:45,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 18:07:45,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 18:07:45,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 18:07:45,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 18:07:45,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 18:07:45,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 18:07:45,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 18:07:45,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 18:07:45,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 18:07:45,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 18:07:45,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 18:07:45,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 18:07:45,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 18:07:45,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 18:07:45,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 18:07:45,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 18:07:45,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 18:07:45,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 18:07:45,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 18:07:45,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 18:07:45,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 18:07:45,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 18:07:45,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 18:07:45,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 18:07:45,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 18:07:45,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 18:07:45,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 18:07:45,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 18:07:45,075 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 18:07:45,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 18:07:45,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 18:07:45,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 18:07:45,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 18:07:45,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 18:07:45,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 18:07:45,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 18:07:45,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 18:07:45,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 18:07:45,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 18:07:45,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 18:07:45,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 18:07:45,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 18:07:45,292 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 18:07:45,293 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 18:07:45,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-06-05 18:07:45,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54159c303/2a3d585cab41466e88c0b7dc2629e22a/FLAG3d6ba0a7e [2021-06-05 18:07:45,753 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 18:07:45,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-06-05 18:07:45,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54159c303/2a3d585cab41466e88c0b7dc2629e22a/FLAG3d6ba0a7e [2021-06-05 18:07:45,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54159c303/2a3d585cab41466e88c0b7dc2629e22a [2021-06-05 18:07:45,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 18:07:45,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 18:07:45,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 18:07:45,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 18:07:45,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 18:07:45,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:07:45" (1/1) ... [2021-06-05 18:07:45,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674ff816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:45, skipping insertion in model container [2021-06-05 18:07:45,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 06:07:45" (1/1) ... [2021-06-05 18:07:45,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 18:07:45,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 18:07:45,959 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 18:07:46,114 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/singleton.i[55547,55560] [2021-06-05 18:07:46,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:07:46,175 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 18:07:46,201 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 18:07:46,209 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/singleton.i[55547,55560] [2021-06-05 18:07:46,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 18:07:46,318 INFO L208 MainTranslator]: Completed translation [2021-06-05 18:07:46,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46 WrapperNode [2021-06-05 18:07:46,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 18:07:46,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 18:07:46,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 18:07:46,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 18:07:46,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 18:07:46,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 18:07:46,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 18:07:46,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 18:07:46,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... [2021-06-05 18:07:46,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 18:07:46,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 18:07:46,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 18:07:46,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 18:07:46,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 18:07:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 18:07:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 18:07:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 18:07:46,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 18:07:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 18:07:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-06-05 18:07:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-06-05 18:07:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 18:07:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 18:07:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 18:07:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 18:07:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 18:07:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 18:07:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 18:07:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-05 18:07:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 18:07:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 18:07:46,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 18:07:46,479 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 18:07:46,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 18:07:46,817 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-05 18:07:46,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:07:46 BoogieIcfgContainer [2021-06-05 18:07:46,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 18:07:46,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 18:07:46,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 18:07:46,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 18:07:46,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 06:07:45" (1/3) ... [2021-06-05 18:07:46,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678c2c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:07:46, skipping insertion in model container [2021-06-05 18:07:46,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 06:07:46" (2/3) ... [2021-06-05 18:07:46,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678c2c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 06:07:46, skipping insertion in model container [2021-06-05 18:07:46,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 06:07:46" (3/3) ... [2021-06-05 18:07:46,828 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-06-05 18:07:46,832 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 18:07:46,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 18:07:46,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 18:07:46,833 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 18:07:46,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,886 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,889 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,889 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,889 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,889 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,890 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,891 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,891 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,891 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,891 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,892 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,892 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,892 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,893 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,894 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,894 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,894 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,895 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,896 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,896 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,896 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,896 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,897 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,903 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,903 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,904 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,905 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,907 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,912 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,918 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,919 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,920 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,925 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,926 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,927 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,929 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,929 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,930 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,930 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,930 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,931 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,931 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,931 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,931 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,935 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,936 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,936 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,938 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,938 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,938 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,942 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,944 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,945 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,945 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,945 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,952 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,953 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,954 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,955 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,956 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,956 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,956 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,957 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,957 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,957 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,957 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,958 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,958 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,960 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,960 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,960 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,960 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,962 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,962 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,962 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,962 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,965 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,965 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,965 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,965 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,967 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,967 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,967 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:46,967 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 18:07:47,134 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-06-05 18:07:47,149 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 18:07:47,168 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:07:47,168 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:07:47,168 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:07:47,168 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:07:47,168 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:07:47,168 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:07:47,168 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:07:47,168 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread0======== [2021-06-05 18:07:47,182 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-06-05 18:07:53,221 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:53,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:07:53,802 INFO L301 ceAbstractionStarter]: Result for error location thread0 was SAFE (1/3) [2021-06-05 18:07:53,804 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 18:07:53,809 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:07:53,809 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:07:53,811 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:07:53,811 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:07:53,811 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:07:53,811 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:07:53,811 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:07:53,811 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 18:07:53,818 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-06-05 18:07:59,129 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:07:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 18:07:59,216 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:07:59,217 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:07:59,217 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:07:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:07:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash -811265628, now seen corresponding path program 1 times [2021-06-05 18:07:59,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:07:59,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174740268] [2021-06-05 18:07:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:07:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:07:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:07:59,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:07:59,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174740268] [2021-06-05 18:07:59,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174740268] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:07:59,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:07:59,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 18:07:59,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796785747] [2021-06-05 18:07:59,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 18:07:59,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:07:59,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 18:07:59,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:07:59,746 INFO L87 Difference]: Start difference. First operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 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 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:01,221 INFO L93 Difference]: Finished difference Result 76010 states and 329094 transitions. [2021-06-05 18:08:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 18:08:01,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 41 [2021-06-05 18:08:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:01,537 INFO L225 Difference]: With dead ends: 76010 [2021-06-05 18:08:01,537 INFO L226 Difference]: Without dead ends: 54772 [2021-06-05 18:08:01,539 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 305.0ms TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:08:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54772 states. [2021-06-05 18:08:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54772 to 46283. [2021-06-05 18:08:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46283 states, 46280 states have (on average 4.362337942955921) internal successors, (201889), 46282 states have internal predecessors, (201889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 201889 transitions. [2021-06-05 18:08:03,544 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 201889 transitions. Word has length 41 [2021-06-05 18:08:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:03,545 INFO L482 AbstractCegarLoop]: Abstraction has 46283 states and 201889 transitions. [2021-06-05 18:08:03,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 201889 transitions. [2021-06-05 18:08:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 18:08:03,547 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:03,547 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:03,547 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 18:08:03,547 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash -589683484, now seen corresponding path program 2 times [2021-06-05 18:08:03,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:03,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3225619] [2021-06-05 18:08:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:03,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:03,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3225619] [2021-06-05 18:08:03,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3225619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:03,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:03,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 18:08:03,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547810868] [2021-06-05 18:08:03,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 18:08:03,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 18:08:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:08:03,792 INFO L87 Difference]: Start difference. First operand 46283 states and 201889 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:04,872 INFO L93 Difference]: Finished difference Result 54799 states and 241924 transitions. [2021-06-05 18:08:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 18:08:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 41 [2021-06-05 18:08:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:05,107 INFO L225 Difference]: With dead ends: 54799 [2021-06-05 18:08:05,107 INFO L226 Difference]: Without dead ends: 54799 [2021-06-05 18:08:05,108 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 337.3ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:08:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54799 states. [2021-06-05 18:08:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54799 to 46286. [2021-06-05 18:08:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46286 states, 46283 states have (on average 4.362120000864248) internal successors, (201892), 46285 states have internal predecessors, (201892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46286 states to 46286 states and 201892 transitions. [2021-06-05 18:08:06,813 INFO L78 Accepts]: Start accepts. Automaton has 46286 states and 201892 transitions. Word has length 41 [2021-06-05 18:08:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:06,814 INFO L482 AbstractCegarLoop]: Abstraction has 46286 states and 201892 transitions. [2021-06-05 18:08:06,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 46286 states and 201892 transitions. [2021-06-05 18:08:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 18:08:06,817 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:06,817 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:06,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 18:08:06,817 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 325896192, now seen corresponding path program 3 times [2021-06-05 18:08:06,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:06,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534403523] [2021-06-05 18:08:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:07,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:07,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534403523] [2021-06-05 18:08:07,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534403523] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:07,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:07,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 18:08:07,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741855010] [2021-06-05 18:08:07,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 18:08:07,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 18:08:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 18:08:07,091 INFO L87 Difference]: Start difference. First operand 46286 states and 201892 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:07,953 INFO L93 Difference]: Finished difference Result 54743 states and 241824 transitions. [2021-06-05 18:08:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 18:08:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 41 [2021-06-05 18:08:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:08,142 INFO L225 Difference]: With dead ends: 54743 [2021-06-05 18:08:08,142 INFO L226 Difference]: Without dead ends: 54743 [2021-06-05 18:08:08,142 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 205.9ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:08:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2021-06-05 18:08:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 46227. [2021-06-05 18:08:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46227 states, 46225 states have (on average 4.365365062195782) internal successors, (201789), 46226 states have internal predecessors, (201789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46227 states to 46227 states and 201789 transitions. [2021-06-05 18:08:09,703 INFO L78 Accepts]: Start accepts. Automaton has 46227 states and 201789 transitions. Word has length 41 [2021-06-05 18:08:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:09,704 INFO L482 AbstractCegarLoop]: Abstraction has 46227 states and 201789 transitions. [2021-06-05 18:08:09,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 46227 states and 201789 transitions. [2021-06-05 18:08:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 18:08:09,706 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:09,706 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:09,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 18:08:09,706 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 5132427, now seen corresponding path program 1 times [2021-06-05 18:08:09,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:09,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396880133] [2021-06-05 18:08:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:09,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:09,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396880133] [2021-06-05 18:08:09,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396880133] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:09,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:09,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 18:08:09,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006333647] [2021-06-05 18:08:09,748 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 18:08:09,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 18:08:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 18:08:09,748 INFO L87 Difference]: Start difference. First operand 46227 states and 201789 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:10,525 INFO L93 Difference]: Finished difference Result 96773 states and 411557 transitions. [2021-06-05 18:08:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 18:08:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 18:08:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:10,720 INFO L225 Difference]: With dead ends: 96773 [2021-06-05 18:08:10,721 INFO L226 Difference]: Without dead ends: 61407 [2021-06-05 18:08:10,721 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 34.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:08:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2021-06-05 18:08:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 49089. [2021-06-05 18:08:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49089 states, 49087 states have (on average 4.207203536577913) internal successors, (206519), 49088 states have internal predecessors, (206519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 206519 transitions. [2021-06-05 18:08:12,426 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 206519 transitions. Word has length 54 [2021-06-05 18:08:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:12,437 INFO L482 AbstractCegarLoop]: Abstraction has 49089 states and 206519 transitions. [2021-06-05 18:08:12,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 206519 transitions. [2021-06-05 18:08:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 18:08:12,443 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:12,443 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:12,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 18:08:12,444 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:12,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1772961110, now seen corresponding path program 1 times [2021-06-05 18:08:12,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:12,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908397723] [2021-06-05 18:08:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:12,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:12,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908397723] [2021-06-05 18:08:12,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908397723] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:12,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:12,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 18:08:12,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927145215] [2021-06-05 18:08:12,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:08:12,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:08:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:08:12,528 INFO L87 Difference]: Start difference. First operand 49089 states and 206519 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:13,125 INFO L93 Difference]: Finished difference Result 67425 states and 276590 transitions. [2021-06-05 18:08:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 18:08:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 59 [2021-06-05 18:08:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:13,285 INFO L225 Difference]: With dead ends: 67425 [2021-06-05 18:08:13,285 INFO L226 Difference]: Without dead ends: 61341 [2021-06-05 18:08:13,285 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 128.4ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:08:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61341 states. [2021-06-05 18:08:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61341 to 48869. [2021-06-05 18:08:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48869 states, 48867 states have (on average 4.211697055272475) internal successors, (205813), 48868 states have internal predecessors, (205813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48869 states to 48869 states and 205813 transitions. [2021-06-05 18:08:14,865 INFO L78 Accepts]: Start accepts. Automaton has 48869 states and 205813 transitions. Word has length 59 [2021-06-05 18:08:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:14,866 INFO L482 AbstractCegarLoop]: Abstraction has 48869 states and 205813 transitions. [2021-06-05 18:08:14,866 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48869 states and 205813 transitions. [2021-06-05 18:08:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 18:08:14,871 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:14,871 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:14,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 18:08:14,871 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1864004856, now seen corresponding path program 1 times [2021-06-05 18:08:14,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:14,872 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688266781] [2021-06-05 18:08:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:15,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:15,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688266781] [2021-06-05 18:08:15,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688266781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:15,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:15,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 18:08:15,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823170343] [2021-06-05 18:08:15,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 18:08:15,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 18:08:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:08:15,354 INFO L87 Difference]: Start difference. First operand 48869 states and 205813 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:16,131 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 18:08:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:17,226 INFO L93 Difference]: Finished difference Result 57826 states and 244284 transitions. [2021-06-05 18:08:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 18:08:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 60 [2021-06-05 18:08:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:17,409 INFO L225 Difference]: With dead ends: 57826 [2021-06-05 18:08:17,409 INFO L226 Difference]: Without dead ends: 57556 [2021-06-05 18:08:17,409 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1005.2ms TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 18:08:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57556 states. [2021-06-05 18:08:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57556 to 54249. [2021-06-05 18:08:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54249 states, 54247 states have (on average 4.2520139362545395) internal successors, (230659), 54248 states have internal predecessors, (230659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54249 states to 54249 states and 230659 transitions. [2021-06-05 18:08:19,120 INFO L78 Accepts]: Start accepts. Automaton has 54249 states and 230659 transitions. Word has length 60 [2021-06-05 18:08:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:19,121 INFO L482 AbstractCegarLoop]: Abstraction has 54249 states and 230659 transitions. [2021-06-05 18:08:19,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 54249 states and 230659 transitions. [2021-06-05 18:08:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 18:08:19,128 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:19,128 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:19,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 18:08:19,129 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1211952212, now seen corresponding path program 2 times [2021-06-05 18:08:19,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:19,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22489813] [2021-06-05 18:08:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:19,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:19,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22489813] [2021-06-05 18:08:19,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22489813] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:19,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:19,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 18:08:19,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770432727] [2021-06-05 18:08:19,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 18:08:19,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:19,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 18:08:19,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 18:08:19,447 INFO L87 Difference]: Start difference. First operand 54249 states and 230659 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:20,824 INFO L93 Difference]: Finished difference Result 63262 states and 269281 transitions. [2021-06-05 18:08:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:08:20,824 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 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 60 [2021-06-05 18:08:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:21,015 INFO L225 Difference]: With dead ends: 63262 [2021-06-05 18:08:21,015 INFO L226 Difference]: Without dead ends: 62992 [2021-06-05 18:08:21,016 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 565.5ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 18:08:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62992 states. [2021-06-05 18:08:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62992 to 54264. [2021-06-05 18:08:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54264 states, 54262 states have (on average 4.2514466846043275) internal successors, (230692), 54263 states have internal predecessors, (230692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54264 states to 54264 states and 230692 transitions. [2021-06-05 18:08:22,467 INFO L78 Accepts]: Start accepts. Automaton has 54264 states and 230692 transitions. Word has length 60 [2021-06-05 18:08:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:22,467 INFO L482 AbstractCegarLoop]: Abstraction has 54264 states and 230692 transitions. [2021-06-05 18:08:22,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 54264 states and 230692 transitions. [2021-06-05 18:08:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 18:08:22,475 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:22,475 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:22,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 18:08:22,475 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1520073798, now seen corresponding path program 3 times [2021-06-05 18:08:22,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:22,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601680455] [2021-06-05 18:08:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:22,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:22,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601680455] [2021-06-05 18:08:22,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601680455] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:22,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:22,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 18:08:22,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014003149] [2021-06-05 18:08:22,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 18:08:22,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 18:08:22,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:08:22,777 INFO L87 Difference]: Start difference. First operand 54264 states and 230692 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:24,266 INFO L93 Difference]: Finished difference Result 63260 states and 269245 transitions. [2021-06-05 18:08:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 18:08:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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 60 [2021-06-05 18:08:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:24,443 INFO L225 Difference]: With dead ends: 63260 [2021-06-05 18:08:24,444 INFO L226 Difference]: Without dead ends: 62990 [2021-06-05 18:08:24,444 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 476.0ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:08:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62990 states. [2021-06-05 18:08:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62990 to 54281. [2021-06-05 18:08:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54281 states, 54279 states have (on average 4.250759962416404) internal successors, (230727), 54280 states have internal predecessors, (230727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 230727 transitions. [2021-06-05 18:08:26,271 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 230727 transitions. Word has length 60 [2021-06-05 18:08:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:26,271 INFO L482 AbstractCegarLoop]: Abstraction has 54281 states and 230727 transitions. [2021-06-05 18:08:26,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 230727 transitions. [2021-06-05 18:08:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 18:08:26,279 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:26,279 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:26,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 18:08:26,279 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -181639794, now seen corresponding path program 4 times [2021-06-05 18:08:26,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:26,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259055149] [2021-06-05 18:08:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:26,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:26,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259055149] [2021-06-05 18:08:26,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259055149] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:26,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:26,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 18:08:26,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961294334] [2021-06-05 18:08:26,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 18:08:26,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 18:08:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:08:26,564 INFO L87 Difference]: Start difference. First operand 54281 states and 230727 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:27,451 INFO L93 Difference]: Finished difference Result 63305 states and 269323 transitions. [2021-06-05 18:08:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 18:08:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 60 [2021-06-05 18:08:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:27,625 INFO L225 Difference]: With dead ends: 63305 [2021-06-05 18:08:27,625 INFO L226 Difference]: Without dead ends: 63035 [2021-06-05 18:08:27,626 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 343.2ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:08:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63035 states. [2021-06-05 18:08:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63035 to 54310. [2021-06-05 18:08:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54310 states, 54308 states have (on average 4.249318700743905) internal successors, (230772), 54309 states have internal predecessors, (230772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54310 states to 54310 states and 230772 transitions. [2021-06-05 18:08:29,546 INFO L78 Accepts]: Start accepts. Automaton has 54310 states and 230772 transitions. Word has length 60 [2021-06-05 18:08:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:29,546 INFO L482 AbstractCegarLoop]: Abstraction has 54310 states and 230772 transitions. [2021-06-05 18:08:29,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 54310 states and 230772 transitions. [2021-06-05 18:08:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 18:08:29,553 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:29,553 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:29,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 18:08:29,553 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -994232682, now seen corresponding path program 5 times [2021-06-05 18:08:29,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:29,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738498658] [2021-06-05 18:08:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:29,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:29,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738498658] [2021-06-05 18:08:29,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738498658] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:29,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:29,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 18:08:29,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308653442] [2021-06-05 18:08:29,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:08:29,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:08:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:08:29,745 INFO L87 Difference]: Start difference. First operand 54310 states and 230772 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:30,377 INFO L93 Difference]: Finished difference Result 63086 states and 268677 transitions. [2021-06-05 18:08:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 18:08:30,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 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 60 [2021-06-05 18:08:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:30,895 INFO L225 Difference]: With dead ends: 63086 [2021-06-05 18:08:30,896 INFO L226 Difference]: Without dead ends: 62816 [2021-06-05 18:08:30,896 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 216.1ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:08:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2021-06-05 18:08:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 54062. [2021-06-05 18:08:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54062 states, 54060 states have (on average 4.256030336662967) internal successors, (230081), 54061 states have internal predecessors, (230081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54062 states to 54062 states and 230081 transitions. [2021-06-05 18:08:32,271 INFO L78 Accepts]: Start accepts. Automaton has 54062 states and 230081 transitions. Word has length 60 [2021-06-05 18:08:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:32,271 INFO L482 AbstractCegarLoop]: Abstraction has 54062 states and 230081 transitions. [2021-06-05 18:08:32,271 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54062 states and 230081 transitions. [2021-06-05 18:08:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:32,281 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:32,281 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:32,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 18:08:32,281 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash -114684342, now seen corresponding path program 1 times [2021-06-05 18:08:32,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:32,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798039552] [2021-06-05 18:08:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:32,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:32,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798039552] [2021-06-05 18:08:32,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798039552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:32,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:32,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 18:08:32,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147939632] [2021-06-05 18:08:32,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 18:08:32,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:32,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 18:08:32,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:08:32,680 INFO L87 Difference]: Start difference. First operand 54062 states and 230081 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:34,281 INFO L93 Difference]: Finished difference Result 65701 states and 278957 transitions. [2021-06-05 18:08:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:08:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:34,485 INFO L225 Difference]: With dead ends: 65701 [2021-06-05 18:08:34,486 INFO L226 Difference]: Without dead ends: 65359 [2021-06-05 18:08:34,486 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 750.1ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 18:08:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65359 states. [2021-06-05 18:08:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65359 to 60588. [2021-06-05 18:08:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-05 18:08:36,066 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-05 18:08:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:36,066 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-05 18:08:36,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-05 18:08:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:36,080 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:36,080 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:36,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 18:08:36,080 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2145648845, now seen corresponding path program 1 times [2021-06-05 18:08:36,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:36,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947764177] [2021-06-05 18:08:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:36,967 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 18:08:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:37,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:37,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947764177] [2021-06-05 18:08:37,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947764177] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:37,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:37,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 18:08:37,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84029842] [2021-06-05 18:08:37,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 18:08:37,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 18:08:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:08:37,047 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:38,497 INFO L93 Difference]: Finished difference Result 71076 states and 302873 transitions. [2021-06-05 18:08:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:08:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:38,698 INFO L225 Difference]: With dead ends: 71076 [2021-06-05 18:08:38,698 INFO L226 Difference]: Without dead ends: 70734 [2021-06-05 18:08:38,699 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 834.0ms TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 18:08:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70734 states. [2021-06-05 18:08:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70734 to 60588. [2021-06-05 18:08:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-05 18:08:40,563 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-05 18:08:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:40,564 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-05 18:08:40,564 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-05 18:08:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:40,576 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:40,576 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:40,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 18:08:40,577 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 876817915, now seen corresponding path program 2 times [2021-06-05 18:08:40,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:40,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020365411] [2021-06-05 18:08:40,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:40,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:40,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020365411] [2021-06-05 18:08:40,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020365411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:40,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:40,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 18:08:40,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419839403] [2021-06-05 18:08:40,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 18:08:40,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 18:08:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 18:08:40,927 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:42,553 INFO L93 Difference]: Finished difference Result 73658 states and 314685 transitions. [2021-06-05 18:08:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 18:08:42,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:42,780 INFO L225 Difference]: With dead ends: 73658 [2021-06-05 18:08:42,780 INFO L226 Difference]: Without dead ends: 73316 [2021-06-05 18:08:42,781 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 581.5ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-06-05 18:08:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2021-06-05 18:08:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 57618. [2021-06-05 18:08:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57618 states, 57616 states have (on average 4.267998472646487) internal successors, (245905), 57617 states have internal predecessors, (245905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 245905 transitions. [2021-06-05 18:08:44,383 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 245905 transitions. Word has length 62 [2021-06-05 18:08:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:44,383 INFO L482 AbstractCegarLoop]: Abstraction has 57618 states and 245905 transitions. [2021-06-05 18:08:44,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 245905 transitions. [2021-06-05 18:08:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:44,395 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:44,395 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:44,395 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 18:08:44,395 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash -708279666, now seen corresponding path program 2 times [2021-06-05 18:08:44,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:44,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218317464] [2021-06-05 18:08:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:44,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:44,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218317464] [2021-06-05 18:08:44,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218317464] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:44,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:44,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 18:08:44,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664647472] [2021-06-05 18:08:44,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 18:08:44,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:44,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 18:08:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:08:44,611 INFO L87 Difference]: Start difference. First operand 57618 states and 245905 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:45,269 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-06-05 18:08:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:45,853 INFO L93 Difference]: Finished difference Result 65384 states and 277429 transitions. [2021-06-05 18:08:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 18:08:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:46,043 INFO L225 Difference]: With dead ends: 65384 [2021-06-05 18:08:46,043 INFO L226 Difference]: Without dead ends: 65042 [2021-06-05 18:08:46,044 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 720.3ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 18:08:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2021-06-05 18:08:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 57621. [2021-06-05 18:08:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57621 states, 57619 states have (on average 4.267828320519273) internal successors, (245908), 57620 states have internal predecessors, (245908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57621 states to 57621 states and 245908 transitions. [2021-06-05 18:08:47,646 INFO L78 Accepts]: Start accepts. Automaton has 57621 states and 245908 transitions. Word has length 62 [2021-06-05 18:08:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:47,646 INFO L482 AbstractCegarLoop]: Abstraction has 57621 states and 245908 transitions. [2021-06-05 18:08:47,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57621 states and 245908 transitions. [2021-06-05 18:08:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:47,658 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:47,658 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:47,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 18:08:47,659 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1418123072, now seen corresponding path program 3 times [2021-06-05 18:08:47,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:47,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32965007] [2021-06-05 18:08:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:47,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:47,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32965007] [2021-06-05 18:08:47,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32965007] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:47,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:47,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:08:47,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408626744] [2021-06-05 18:08:47,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:08:47,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:08:47,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:08:47,846 INFO L87 Difference]: Start difference. First operand 57621 states and 245908 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:48,992 INFO L93 Difference]: Finished difference Result 65409 states and 277466 transitions. [2021-06-05 18:08:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 18:08:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:49,181 INFO L225 Difference]: With dead ends: 65409 [2021-06-05 18:08:49,181 INFO L226 Difference]: Without dead ends: 65067 [2021-06-05 18:08:49,182 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 297.3ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:08:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65067 states. [2021-06-05 18:08:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65067 to 57649. [2021-06-05 18:08:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57649 states, 57647 states have (on average 4.266518639304734) internal successors, (245952), 57648 states have internal predecessors, (245952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57649 states to 57649 states and 245952 transitions. [2021-06-05 18:08:50,764 INFO L78 Accepts]: Start accepts. Automaton has 57649 states and 245952 transitions. Word has length 62 [2021-06-05 18:08:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:50,764 INFO L482 AbstractCegarLoop]: Abstraction has 57649 states and 245952 transitions. [2021-06-05 18:08:50,764 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 57649 states and 245952 transitions. [2021-06-05 18:08:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 18:08:50,785 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:50,785 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:50,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 18:08:50,785 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash 670055796, now seen corresponding path program 4 times [2021-06-05 18:08:50,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:50,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026327588] [2021-06-05 18:08:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:51,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:51,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026327588] [2021-06-05 18:08:51,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026327588] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:51,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:51,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 18:08:51,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640621849] [2021-06-05 18:08:51,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 18:08:51,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:51,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 18:08:51,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-06-05 18:08:51,097 INFO L87 Difference]: Start difference. First operand 57649 states and 245952 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:52,350 INFO L93 Difference]: Finished difference Result 60948 states and 256662 transitions. [2021-06-05 18:08:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 18:08:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2021-06-05 18:08:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:52,517 INFO L225 Difference]: With dead ends: 60948 [2021-06-05 18:08:52,517 INFO L226 Difference]: Without dead ends: 60606 [2021-06-05 18:08:52,517 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 272.2ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 18:08:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60606 states. [2021-06-05 18:08:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60606 to 53160. [2021-06-05 18:08:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53160 states, 53158 states have (on average 4.234621317581549) internal successors, (225104), 53159 states have internal predecessors, (225104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 225104 transitions. [2021-06-05 18:08:54,055 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 225104 transitions. Word has length 62 [2021-06-05 18:08:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:54,055 INFO L482 AbstractCegarLoop]: Abstraction has 53160 states and 225104 transitions. [2021-06-05 18:08:54,055 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 225104 transitions. [2021-06-05 18:08:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 18:08:54,071 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:54,071 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:54,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 18:08:54,071 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -27681967, now seen corresponding path program 1 times [2021-06-05 18:08:54,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:54,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114778757] [2021-06-05 18:08:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:54,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:54,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114778757] [2021-06-05 18:08:54,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114778757] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:54,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:54,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 18:08:54,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305628241] [2021-06-05 18:08:54,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 18:08:54,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 18:08:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:08:54,505 INFO L87 Difference]: Start difference. First operand 53160 states and 225104 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:55,163 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2021-06-05 18:08:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:56,455 INFO L93 Difference]: Finished difference Result 64389 states and 274500 transitions. [2021-06-05 18:08:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:08:56,456 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 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 65 [2021-06-05 18:08:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:56,644 INFO L225 Difference]: With dead ends: 64389 [2021-06-05 18:08:56,644 INFO L226 Difference]: Without dead ends: 64119 [2021-06-05 18:08:56,645 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1232.8ms TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 18:08:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2021-06-05 18:08:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 54940. [2021-06-05 18:08:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54940 states, 54938 states have (on average 4.293439877680294) internal successors, (235873), 54939 states have internal predecessors, (235873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54940 states to 54940 states and 235873 transitions. [2021-06-05 18:08:58,668 INFO L78 Accepts]: Start accepts. Automaton has 54940 states and 235873 transitions. Word has length 65 [2021-06-05 18:08:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:08:58,668 INFO L482 AbstractCegarLoop]: Abstraction has 54940 states and 235873 transitions. [2021-06-05 18:08:58,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 54940 states and 235873 transitions. [2021-06-05 18:08:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 18:08:58,738 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:08:58,738 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:08:58,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 18:08:58,738 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:08:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:08:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 225742194, now seen corresponding path program 1 times [2021-06-05 18:08:58,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:08:58,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182735823] [2021-06-05 18:08:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:08:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:08:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:08:58,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:08:58,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182735823] [2021-06-05 18:08:58,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182735823] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:08:58,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:08:58,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 18:08:58,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528238438] [2021-06-05 18:08:58,842 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:08:58,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:08:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:08:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:08:58,842 INFO L87 Difference]: Start difference. First operand 54940 states and 235873 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:08:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:08:59,448 INFO L93 Difference]: Finished difference Result 74107 states and 309485 transitions. [2021-06-05 18:08:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 18:08:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2021-06-05 18:08:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:08:59,646 INFO L225 Difference]: With dead ends: 74107 [2021-06-05 18:08:59,646 INFO L226 Difference]: Without dead ends: 67995 [2021-06-05 18:08:59,646 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 114.2ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:08:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67995 states. [2021-06-05 18:09:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67995 to 55174. [2021-06-05 18:09:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55174 states, 55172 states have (on average 4.289802798520989) internal successors, (236677), 55173 states have internal predecessors, (236677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 236677 transitions. [2021-06-05 18:09:01,292 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 236677 transitions. Word has length 65 [2021-06-05 18:09:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:01,293 INFO L482 AbstractCegarLoop]: Abstraction has 55174 states and 236677 transitions. [2021-06-05 18:09:01,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 236677 transitions. [2021-06-05 18:09:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 18:09:01,314 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:01,314 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:01,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 18:09:01,314 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2097849996, now seen corresponding path program 2 times [2021-06-05 18:09:01,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:01,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940796794] [2021-06-05 18:09:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:01,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:01,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940796794] [2021-06-05 18:09:01,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940796794] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:01,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:01,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:09:01,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543074619] [2021-06-05 18:09:01,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:09:01,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:09:01,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:09:01,397 INFO L87 Difference]: Start difference. First operand 55174 states and 236677 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:02,319 INFO L93 Difference]: Finished difference Result 72794 states and 304360 transitions. [2021-06-05 18:09:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 18:09:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 65 [2021-06-05 18:09:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:02,514 INFO L225 Difference]: With dead ends: 72794 [2021-06-05 18:09:02,514 INFO L226 Difference]: Without dead ends: 66814 [2021-06-05 18:09:02,515 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 169.8ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:09:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66814 states. [2021-06-05 18:09:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66814 to 54455. [2021-06-05 18:09:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54455 states, 54453 states have (on average 4.294363946889979) internal successors, (233841), 54454 states have internal predecessors, (233841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54455 states to 54455 states and 233841 transitions. [2021-06-05 18:09:04,084 INFO L78 Accepts]: Start accepts. Automaton has 54455 states and 233841 transitions. Word has length 65 [2021-06-05 18:09:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:04,085 INFO L482 AbstractCegarLoop]: Abstraction has 54455 states and 233841 transitions. [2021-06-05 18:09:04,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54455 states and 233841 transitions. [2021-06-05 18:09:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 18:09:04,112 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:04,112 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:04,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 18:09:04,112 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1600315377, now seen corresponding path program 1 times [2021-06-05 18:09:04,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:04,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786663046] [2021-06-05 18:09:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:04,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:04,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786663046] [2021-06-05 18:09:04,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786663046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:04,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:04,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 18:09:04,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5980719] [2021-06-05 18:09:04,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 18:09:04,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:04,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 18:09:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:09:04,538 INFO L87 Difference]: Start difference. First operand 54455 states and 233841 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:06,395 INFO L93 Difference]: Finished difference Result 60956 states and 259147 transitions. [2021-06-05 18:09:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 18:09:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 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 67 [2021-06-05 18:09:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:06,572 INFO L225 Difference]: With dead ends: 60956 [2021-06-05 18:09:06,572 INFO L226 Difference]: Without dead ends: 60614 [2021-06-05 18:09:06,572 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 845.0ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 18:09:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60614 states. [2021-06-05 18:09:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60614 to 49129. [2021-06-05 18:09:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49129 states, 49127 states have (on average 4.269749832067905) internal successors, (209760), 49128 states have internal predecessors, (209760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49129 states to 49129 states and 209760 transitions. [2021-06-05 18:09:07,950 INFO L78 Accepts]: Start accepts. Automaton has 49129 states and 209760 transitions. Word has length 67 [2021-06-05 18:09:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:07,950 INFO L482 AbstractCegarLoop]: Abstraction has 49129 states and 209760 transitions. [2021-06-05 18:09:07,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49129 states and 209760 transitions. [2021-06-05 18:09:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:07,976 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:07,977 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:07,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 18:09:07,977 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1860189259, now seen corresponding path program 1 times [2021-06-05 18:09:07,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:07,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604838035] [2021-06-05 18:09:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:08,339 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2021-06-05 18:09:08,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-06-05 18:09:08,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:08,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604838035] [2021-06-05 18:09:08,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604838035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:08,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:08,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:09:08,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301354744] [2021-06-05 18:09:08,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:09:08,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:08,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:09:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:09:08,816 INFO L87 Difference]: Start difference. First operand 49129 states and 209760 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:10,469 INFO L93 Difference]: Finished difference Result 55018 states and 232303 transitions. [2021-06-05 18:09:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 18:09:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:10,888 INFO L225 Difference]: With dead ends: 55018 [2021-06-05 18:09:10,889 INFO L226 Difference]: Without dead ends: 53779 [2021-06-05 18:09:10,889 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1329.7ms TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 18:09:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53779 states. [2021-06-05 18:09:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53779 to 51011. [2021-06-05 18:09:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51011 states, 51009 states have (on average 4.255660765747221) internal successors, (217077), 51010 states have internal predecessors, (217077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51011 states to 51011 states and 217077 transitions. [2021-06-05 18:09:12,242 INFO L78 Accepts]: Start accepts. Automaton has 51011 states and 217077 transitions. Word has length 68 [2021-06-05 18:09:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:12,244 INFO L482 AbstractCegarLoop]: Abstraction has 51011 states and 217077 transitions. [2021-06-05 18:09:12,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 51011 states and 217077 transitions. [2021-06-05 18:09:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:12,271 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:12,272 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:12,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 18:09:12,272 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827065, now seen corresponding path program 2 times [2021-06-05 18:09:12,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:12,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250774084] [2021-06-05 18:09:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:12,657 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:12,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250774084] [2021-06-05 18:09:12,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250774084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:12,657 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:12,657 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 18:09:12,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645811930] [2021-06-05 18:09:12,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 18:09:12,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:12,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 18:09:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:09:12,658 INFO L87 Difference]: Start difference. First operand 51011 states and 217077 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:13,876 INFO L93 Difference]: Finished difference Result 57017 states and 239942 transitions. [2021-06-05 18:09:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:09:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:14,031 INFO L225 Difference]: With dead ends: 57017 [2021-06-05 18:09:14,031 INFO L226 Difference]: Without dead ends: 55733 [2021-06-05 18:09:14,032 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 744.2ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 18:09:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55733 states. [2021-06-05 18:09:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55733 to 51041. [2021-06-05 18:09:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51041 states, 51039 states have (on average 4.254511256098278) internal successors, (217146), 51040 states have internal predecessors, (217146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51041 states to 51041 states and 217146 transitions. [2021-06-05 18:09:15,689 INFO L78 Accepts]: Start accepts. Automaton has 51041 states and 217146 transitions. Word has length 68 [2021-06-05 18:09:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:15,690 INFO L482 AbstractCegarLoop]: Abstraction has 51041 states and 217146 transitions. [2021-06-05 18:09:15,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51041 states and 217146 transitions. [2021-06-05 18:09:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:15,718 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:15,718 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:15,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 18:09:15,718 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1587679323, now seen corresponding path program 3 times [2021-06-05 18:09:15,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:15,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238583232] [2021-06-05 18:09:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:16,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:16,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238583232] [2021-06-05 18:09:16,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238583232] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:16,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:16,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 18:09:16,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766058700] [2021-06-05 18:09:16,057 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 18:09:16,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 18:09:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 18:09:16,057 INFO L87 Difference]: Start difference. First operand 51041 states and 217146 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:17,177 INFO L93 Difference]: Finished difference Result 57090 states and 240097 transitions. [2021-06-05 18:09:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:09:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:17,336 INFO L225 Difference]: With dead ends: 57090 [2021-06-05 18:09:17,336 INFO L226 Difference]: Without dead ends: 55761 [2021-06-05 18:09:17,336 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 621.4ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 18:09:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55761 states. [2021-06-05 18:09:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55761 to 51081. [2021-06-05 18:09:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51079 states have (on average 4.252882789404648) internal successors, (217233), 51080 states have internal predecessors, (217233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 217233 transitions. [2021-06-05 18:09:19,041 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 217233 transitions. Word has length 68 [2021-06-05 18:09:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:19,041 INFO L482 AbstractCegarLoop]: Abstraction has 51081 states and 217233 transitions. [2021-06-05 18:09:19,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 217233 transitions. [2021-06-05 18:09:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:19,096 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:19,097 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:19,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 18:09:19,097 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1285672051, now seen corresponding path program 4 times [2021-06-05 18:09:19,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:19,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99119771] [2021-06-05 18:09:19,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:19,622 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:19,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99119771] [2021-06-05 18:09:19,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99119771] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:19,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:19,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 18:09:19,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942389722] [2021-06-05 18:09:19,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 18:09:19,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 18:09:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 18:09:19,623 INFO L87 Difference]: Start difference. First operand 51081 states and 217233 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:21,180 INFO L93 Difference]: Finished difference Result 57180 states and 240266 transitions. [2021-06-05 18:09:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 18:09:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:21,590 INFO L225 Difference]: With dead ends: 57180 [2021-06-05 18:09:21,590 INFO L226 Difference]: Without dead ends: 55851 [2021-06-05 18:09:21,591 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1162.0ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 18:09:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55851 states. [2021-06-05 18:09:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55851 to 51102. [2021-06-05 18:09:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51102 states, 51100 states have (on average 4.251859099804305) internal successors, (217270), 51101 states have internal predecessors, (217270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51102 states to 51102 states and 217270 transitions. [2021-06-05 18:09:22,951 INFO L78 Accepts]: Start accepts. Automaton has 51102 states and 217270 transitions. Word has length 68 [2021-06-05 18:09:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:22,951 INFO L482 AbstractCegarLoop]: Abstraction has 51102 states and 217270 transitions. [2021-06-05 18:09:22,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51102 states and 217270 transitions. [2021-06-05 18:09:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:22,979 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:22,979 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:22,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 18:09:22,979 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -747687525, now seen corresponding path program 5 times [2021-06-05 18:09:22,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:22,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126173867] [2021-06-05 18:09:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:23,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:23,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126173867] [2021-06-05 18:09:23,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126173867] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:23,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:23,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 18:09:23,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664526133] [2021-06-05 18:09:23,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 18:09:23,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 18:09:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:09:23,209 INFO L87 Difference]: Start difference. First operand 51102 states and 217270 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:24,060 INFO L93 Difference]: Finished difference Result 57173 states and 240259 transitions. [2021-06-05 18:09:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:09:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:24,216 INFO L225 Difference]: With dead ends: 57173 [2021-06-05 18:09:24,216 INFO L226 Difference]: Without dead ends: 55844 [2021-06-05 18:09:24,216 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 370.9ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 18:09:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55844 states. [2021-06-05 18:09:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55844 to 51103. [2021-06-05 18:09:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51101 states have (on average 4.251795463885247) internal successors, (217271), 51102 states have internal predecessors, (217271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 217271 transitions. [2021-06-05 18:09:25,628 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 217271 transitions. Word has length 68 [2021-06-05 18:09:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:25,628 INFO L482 AbstractCegarLoop]: Abstraction has 51103 states and 217271 transitions. [2021-06-05 18:09:25,628 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 217271 transitions. [2021-06-05 18:09:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:25,657 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:25,657 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:25,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 18:09:25,657 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash 229412969, now seen corresponding path program 6 times [2021-06-05 18:09:25,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:25,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587126709] [2021-06-05 18:09:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:26,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:26,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587126709] [2021-06-05 18:09:26,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587126709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:26,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:26,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 18:09:26,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175544835] [2021-06-05 18:09:26,282 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 18:09:26,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 18:09:26,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:09:26,282 INFO L87 Difference]: Start difference. First operand 51103 states and 217271 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:27,111 INFO L93 Difference]: Finished difference Result 57203 states and 240305 transitions. [2021-06-05 18:09:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 18:09:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:27,274 INFO L225 Difference]: With dead ends: 57203 [2021-06-05 18:09:27,275 INFO L226 Difference]: Without dead ends: 55874 [2021-06-05 18:09:27,275 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 420.2ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 18:09:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55874 states. [2021-06-05 18:09:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55874 to 51132. [2021-06-05 18:09:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51132 states, 51130 states have (on average 4.250264032857422) internal successors, (217316), 51131 states have internal predecessors, (217316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51132 states to 51132 states and 217316 transitions. [2021-06-05 18:09:28,679 INFO L78 Accepts]: Start accepts. Automaton has 51132 states and 217316 transitions. Word has length 68 [2021-06-05 18:09:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:28,679 INFO L482 AbstractCegarLoop]: Abstraction has 51132 states and 217316 transitions. [2021-06-05 18:09:28,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 51132 states and 217316 transitions. [2021-06-05 18:09:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 18:09:28,710 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:28,711 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:28,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 18:09:28,711 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -838870671, now seen corresponding path program 7 times [2021-06-05 18:09:28,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:28,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66609595] [2021-06-05 18:09:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:28,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:28,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66609595] [2021-06-05 18:09:28,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66609595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:28,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:28,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 18:09:28,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903047537] [2021-06-05 18:09:28,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 18:09:28,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 18:09:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-06-05 18:09:28,910 INFO L87 Difference]: Start difference. First operand 51132 states and 217316 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:29,730 INFO L93 Difference]: Finished difference Result 55837 states and 234184 transitions. [2021-06-05 18:09:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 18:09:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 18:09:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:29,887 INFO L225 Difference]: With dead ends: 55837 [2021-06-05 18:09:29,887 INFO L226 Difference]: Without dead ends: 54508 [2021-06-05 18:09:29,888 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 232.6ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:09:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54508 states. [2021-06-05 18:09:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54508 to 49737. [2021-06-05 18:09:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.245501156127475) internal successors, (211150), 49736 states have internal predecessors, (211150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211150 transitions. [2021-06-05 18:09:31,233 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211150 transitions. Word has length 68 [2021-06-05 18:09:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:31,233 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211150 transitions. [2021-06-05 18:09:31,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211150 transitions. [2021-06-05 18:09:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 18:09:31,267 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:31,267 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:31,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 18:09:31,267 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash 834173378, now seen corresponding path program 1 times [2021-06-05 18:09:31,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:31,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132110619] [2021-06-05 18:09:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:31,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:31,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132110619] [2021-06-05 18:09:31,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132110619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:31,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:31,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:09:31,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810054333] [2021-06-05 18:09:31,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:09:31,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:09:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:09:31,761 INFO L87 Difference]: Start difference. First operand 49737 states and 211150 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:33,666 INFO L93 Difference]: Finished difference Result 57206 states and 239841 transitions. [2021-06-05 18:09:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:09:33,667 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 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 70 [2021-06-05 18:09:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:33,825 INFO L225 Difference]: With dead ends: 57206 [2021-06-05 18:09:33,825 INFO L226 Difference]: Without dead ends: 56084 [2021-06-05 18:09:33,826 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 970.4ms TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 18:09:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56084 states. [2021-06-05 18:09:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56084 to 49737. [2021-06-05 18:09:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.244596360711772) internal successors, (211105), 49736 states have internal predecessors, (211105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211105 transitions. [2021-06-05 18:09:35,147 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211105 transitions. Word has length 70 [2021-06-05 18:09:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:35,147 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211105 transitions. [2021-06-05 18:09:35,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211105 transitions. [2021-06-05 18:09:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 18:09:35,179 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:35,179 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:35,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 18:09:35,180 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1768735654, now seen corresponding path program 2 times [2021-06-05 18:09:35,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:35,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428660545] [2021-06-05 18:09:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:35,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:35,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428660545] [2021-06-05 18:09:35,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428660545] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:35,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:35,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 18:09:35,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304580148] [2021-06-05 18:09:35,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 18:09:35,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 18:09:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:09:35,598 INFO L87 Difference]: Start difference. First operand 49737 states and 211105 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:36,703 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 18:09:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:37,318 INFO L93 Difference]: Finished difference Result 56867 states and 238439 transitions. [2021-06-05 18:09:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:09:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 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 70 [2021-06-05 18:09:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:37,475 INFO L225 Difference]: With dead ends: 56867 [2021-06-05 18:09:37,476 INFO L226 Difference]: Without dead ends: 55700 [2021-06-05 18:09:37,476 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1043.2ms TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 18:09:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55700 states. [2021-06-05 18:09:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55700 to 49329. [2021-06-05 18:09:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49329 states, 49327 states have (on average 4.248768422973219) internal successors, (209579), 49328 states have internal predecessors, (209579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49329 states to 49329 states and 209579 transitions. [2021-06-05 18:09:38,811 INFO L78 Accepts]: Start accepts. Automaton has 49329 states and 209579 transitions. Word has length 70 [2021-06-05 18:09:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:38,811 INFO L482 AbstractCegarLoop]: Abstraction has 49329 states and 209579 transitions. [2021-06-05 18:09:38,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 49329 states and 209579 transitions. [2021-06-05 18:09:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 18:09:38,847 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:38,847 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:38,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 18:09:38,847 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1375901716, now seen corresponding path program 3 times [2021-06-05 18:09:38,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:38,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46378485] [2021-06-05 18:09:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:39,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:39,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46378485] [2021-06-05 18:09:39,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46378485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:39,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:39,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 18:09:39,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917127754] [2021-06-05 18:09:39,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 18:09:39,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 18:09:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:09:39,228 INFO L87 Difference]: Start difference. First operand 49329 states and 209579 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:40,643 INFO L93 Difference]: Finished difference Result 53309 states and 223950 transitions. [2021-06-05 18:09:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 18:09:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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 70 [2021-06-05 18:09:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:40,788 INFO L225 Difference]: With dead ends: 53309 [2021-06-05 18:09:40,788 INFO L226 Difference]: Without dead ends: 52526 [2021-06-05 18:09:40,789 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 614.6ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 18:09:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52526 states. [2021-06-05 18:09:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52526 to 46131. [2021-06-05 18:09:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46131 states, 46129 states have (on average 4.255609269656832) internal successors, (196307), 46130 states have internal predecessors, (196307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46131 states to 46131 states and 196307 transitions. [2021-06-05 18:09:42,067 INFO L78 Accepts]: Start accepts. Automaton has 46131 states and 196307 transitions. Word has length 70 [2021-06-05 18:09:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:42,067 INFO L482 AbstractCegarLoop]: Abstraction has 46131 states and 196307 transitions. [2021-06-05 18:09:42,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 46131 states and 196307 transitions. [2021-06-05 18:09:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 18:09:42,099 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:42,100 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:42,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 18:09:42,100 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1636468715, now seen corresponding path program 1 times [2021-06-05 18:09:42,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:42,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314153151] [2021-06-05 18:09:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:42,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:42,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314153151] [2021-06-05 18:09:42,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314153151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:42,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:42,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:09:42,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769283519] [2021-06-05 18:09:42,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:09:42,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:09:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:09:42,607 INFO L87 Difference]: Start difference. First operand 46131 states and 196307 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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-06-05 18:09:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:44,472 INFO L93 Difference]: Finished difference Result 46335 states and 194500 transitions. [2021-06-05 18:09:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 18:09:44,473 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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-06-05 18:09:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:44,596 INFO L225 Difference]: With dead ends: 46335 [2021-06-05 18:09:44,597 INFO L226 Difference]: Without dead ends: 45255 [2021-06-05 18:09:44,597 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1040.8ms TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 18:09:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45255 states. [2021-06-05 18:09:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45255 to 40527. [2021-06-05 18:09:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 4.238864898210981) internal successors, (171780), 40526 states have internal predecessors, (171780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 171780 transitions. [2021-06-05 18:09:45,718 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 171780 transitions. Word has length 71 [2021-06-05 18:09:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:45,718 INFO L482 AbstractCegarLoop]: Abstraction has 40527 states and 171780 transitions. [2021-06-05 18:09:45,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 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-06-05 18:09:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 171780 transitions. [2021-06-05 18:09:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 18:09:45,753 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:45,753 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:45,753 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 18:09:45,753 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -992111004, now seen corresponding path program 1 times [2021-06-05 18:09:45,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:45,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178078212] [2021-06-05 18:09:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:45,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:45,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178078212] [2021-06-05 18:09:45,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178078212] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:45,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:45,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 18:09:45,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379013370] [2021-06-05 18:09:45,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 18:09:45,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 18:09:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 18:09:45,803 INFO L87 Difference]: Start difference. First operand 40527 states and 171780 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-06-05 18:09:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:46,323 INFO L93 Difference]: Finished difference Result 62148 states and 255238 transitions. [2021-06-05 18:09:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 18:09:46,323 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-06-05 18:09:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:46,446 INFO L225 Difference]: With dead ends: 62148 [2021-06-05 18:09:46,446 INFO L226 Difference]: Without dead ends: 47082 [2021-06-05 18:09:46,447 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:09:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2021-06-05 18:09:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 37407. [2021-06-05 18:09:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37407 states, 37405 states have (on average 4.195535356235798) internal successors, (156934), 37406 states have internal predecessors, (156934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 156934 transitions. [2021-06-05 18:09:47,619 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 156934 transitions. Word has length 71 [2021-06-05 18:09:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:47,619 INFO L482 AbstractCegarLoop]: Abstraction has 37407 states and 156934 transitions. [2021-06-05 18:09:47,619 INFO L483 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-06-05 18:09:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 156934 transitions. [2021-06-05 18:09:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 18:09:47,649 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:47,649 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:47,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 18:09:47,650 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash 617757196, now seen corresponding path program 2 times [2021-06-05 18:09:47,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:47,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016631618] [2021-06-05 18:09:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:47,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:47,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016631618] [2021-06-05 18:09:47,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016631618] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:47,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:47,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:09:47,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430471885] [2021-06-05 18:09:47,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:09:47,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:09:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:09:47,724 INFO L87 Difference]: Start difference. First operand 37407 states and 156934 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-06-05 18:09:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:48,559 INFO L93 Difference]: Finished difference Result 52101 states and 213437 transitions. [2021-06-05 18:09:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 18:09:48,565 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-06-05 18:09:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:48,694 INFO L225 Difference]: With dead ends: 52101 [2021-06-05 18:09:48,694 INFO L226 Difference]: Without dead ends: 45375 [2021-06-05 18:09:48,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 173.9ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-06-05 18:09:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45375 states. [2021-06-05 18:09:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45375 to 37416. [2021-06-05 18:09:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37414 states have (on average 4.195648687657027) internal successors, (156976), 37415 states have internal predecessors, (156976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 156976 transitions. [2021-06-05 18:09:49,546 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 156976 transitions. Word has length 71 [2021-06-05 18:09:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:49,546 INFO L482 AbstractCegarLoop]: Abstraction has 37416 states and 156976 transitions. [2021-06-05 18:09:49,546 INFO L483 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-06-05 18:09:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 156976 transitions. [2021-06-05 18:09:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 18:09:49,577 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:49,578 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:49,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 18:09:49,578 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1793697038, now seen corresponding path program 3 times [2021-06-05 18:09:49,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:49,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722590438] [2021-06-05 18:09:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:49,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:49,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722590438] [2021-06-05 18:09:49,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722590438] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:49,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:49,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 18:09:49,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632781942] [2021-06-05 18:09:49,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 18:09:49,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:49,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 18:09:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-05 18:09:49,686 INFO L87 Difference]: Start difference. First operand 37416 states and 156976 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 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-06-05 18:09:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:50,522 INFO L93 Difference]: Finished difference Result 47706 states and 195499 transitions. [2021-06-05 18:09:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:09:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 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-06-05 18:09:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:50,639 INFO L225 Difference]: With dead ends: 47706 [2021-06-05 18:09:50,640 INFO L226 Difference]: Without dead ends: 42690 [2021-06-05 18:09:50,640 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 570.4ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-06-05 18:09:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2021-06-05 18:09:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 34959. [2021-06-05 18:09:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34959 states, 34957 states have (on average 4.183539777440856) internal successors, (146244), 34958 states have internal predecessors, (146244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34959 states to 34959 states and 146244 transitions. [2021-06-05 18:09:51,706 INFO L78 Accepts]: Start accepts. Automaton has 34959 states and 146244 transitions. Word has length 71 [2021-06-05 18:09:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:51,706 INFO L482 AbstractCegarLoop]: Abstraction has 34959 states and 146244 transitions. [2021-06-05 18:09:51,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 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-06-05 18:09:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34959 states and 146244 transitions. [2021-06-05 18:09:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 18:09:51,745 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:51,745 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:51,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 18:09:51,745 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash -450918615, now seen corresponding path program 1 times [2021-06-05 18:09:51,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:51,746 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933506907] [2021-06-05 18:09:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:52,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:52,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933506907] [2021-06-05 18:09:52,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933506907] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:52,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:52,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:09:52,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291033300] [2021-06-05 18:09:52,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:09:52,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:09:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:09:52,224 INFO L87 Difference]: Start difference. First operand 34959 states and 146244 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-06-05 18:09:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:54,068 INFO L93 Difference]: Finished difference Result 35853 states and 147820 transitions. [2021-06-05 18:09:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 18:09:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-06-05 18:09:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:54,168 INFO L225 Difference]: With dead ends: 35853 [2021-06-05 18:09:54,168 INFO L226 Difference]: Without dead ends: 34053 [2021-06-05 18:09:54,169 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1080.9ms TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 18:09:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2021-06-05 18:09:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 29025. [2021-06-05 18:09:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 29023 states have (on average 4.175447059228888) internal successors, (121184), 29024 states have internal predecessors, (121184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 121184 transitions. [2021-06-05 18:09:54,813 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 121184 transitions. Word has length 73 [2021-06-05 18:09:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:54,814 INFO L482 AbstractCegarLoop]: Abstraction has 29025 states and 121184 transitions. [2021-06-05 18:09:54,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-06-05 18:09:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 121184 transitions. [2021-06-05 18:09:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 18:09:54,843 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:54,843 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:54,843 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 18:09:54,844 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 958835916, now seen corresponding path program 1 times [2021-06-05 18:09:54,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:54,844 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734958427] [2021-06-05 18:09:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:09:55,587 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 18:09:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:09:55,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:09:55,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734958427] [2021-06-05 18:09:55,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734958427] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:09:55,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:09:55,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 18:09:55,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269248682] [2021-06-05 18:09:55,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 18:09:55,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:09:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 18:09:55,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-05 18:09:55,822 INFO L87 Difference]: Start difference. First operand 29025 states and 121184 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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-06-05 18:09:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:09:58,510 INFO L93 Difference]: Finished difference Result 38504 states and 159667 transitions. [2021-06-05 18:09:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 18:09:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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-06-05 18:09:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:09:58,606 INFO L225 Difference]: With dead ends: 38504 [2021-06-05 18:09:58,606 INFO L226 Difference]: Without dead ends: 34922 [2021-06-05 18:09:58,607 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1954.1ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 18:09:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34922 states. [2021-06-05 18:09:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34922 to 29592. [2021-06-05 18:09:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29592 states, 29590 states have (on average 4.223893207164583) internal successors, (124985), 29591 states have internal predecessors, (124985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:09:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29592 states to 29592 states and 124985 transitions. [2021-06-05 18:09:59,262 INFO L78 Accepts]: Start accepts. Automaton has 29592 states and 124985 transitions. Word has length 73 [2021-06-05 18:09:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:09:59,262 INFO L482 AbstractCegarLoop]: Abstraction has 29592 states and 124985 transitions. [2021-06-05 18:09:59,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 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-06-05 18:09:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29592 states and 124985 transitions. [2021-06-05 18:09:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 18:09:59,294 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:09:59,295 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:09:59,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 18:09:59,295 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:09:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:09:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 937574186, now seen corresponding path program 2 times [2021-06-05 18:09:59,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:09:59,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098962312] [2021-06-05 18:09:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:09:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:00,098 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2021-06-05 18:10:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:00,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:00,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098962312] [2021-06-05 18:10:00,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098962312] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:00,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:00,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-06-05 18:10:00,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824623032] [2021-06-05 18:10:00,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 18:10:00,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 18:10:00,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-06-05 18:10:00,102 INFO L87 Difference]: Start difference. First operand 29592 states and 124985 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 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-06-05 18:10:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:01,706 INFO L93 Difference]: Finished difference Result 29856 states and 124699 transitions. [2021-06-05 18:10:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 18:10:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 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-06-05 18:10:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:01,782 INFO L225 Difference]: With dead ends: 29856 [2021-06-05 18:10:01,782 INFO L226 Difference]: Without dead ends: 27300 [2021-06-05 18:10:01,784 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1369.0ms TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:10:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27300 states. [2021-06-05 18:10:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27300 to 19407. [2021-06-05 18:10:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19405 states have (on average 4.1668126771450655) internal successors, (80857), 19406 states have internal predecessors, (80857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 80857 transitions. [2021-06-05 18:10:02,460 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 80857 transitions. Word has length 73 [2021-06-05 18:10:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:02,460 INFO L482 AbstractCegarLoop]: Abstraction has 19407 states and 80857 transitions. [2021-06-05 18:10:02,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 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-06-05 18:10:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 80857 transitions. [2021-06-05 18:10:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:02,485 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:02,485 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:02,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 18:10:02,486 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1392504587, now seen corresponding path program 1 times [2021-06-05 18:10:02,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:02,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031746219] [2021-06-05 18:10:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:03,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:03,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031746219] [2021-06-05 18:10:03,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031746219] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:03,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:03,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 18:10:03,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653197505] [2021-06-05 18:10:03,057 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 18:10:03,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 18:10:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 18:10:03,057 INFO L87 Difference]: Start difference. First operand 19407 states and 80857 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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-06-05 18:10:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:04,940 INFO L93 Difference]: Finished difference Result 22678 states and 92439 transitions. [2021-06-05 18:10:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 18:10:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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-06-05 18:10:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:05,132 INFO L225 Difference]: With dead ends: 22678 [2021-06-05 18:10:05,132 INFO L226 Difference]: Without dead ends: 19222 [2021-06-05 18:10:05,133 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1185.8ms TimeCoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 18:10:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19222 states. [2021-06-05 18:10:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19222 to 18802. [2021-06-05 18:10:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18802 states, 18800 states have (on average 4.082872340425532) internal successors, (76758), 18801 states have internal predecessors, (76758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18802 states to 18802 states and 76758 transitions. [2021-06-05 18:10:05,486 INFO L78 Accepts]: Start accepts. Automaton has 18802 states and 76758 transitions. Word has length 74 [2021-06-05 18:10:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:05,486 INFO L482 AbstractCegarLoop]: Abstraction has 18802 states and 76758 transitions. [2021-06-05 18:10:05,487 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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-06-05 18:10:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18802 states and 76758 transitions. [2021-06-05 18:10:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:05,511 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:05,512 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:05,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 18:10:05,512 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 461088309, now seen corresponding path program 2 times [2021-06-05 18:10:05,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:05,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742010136] [2021-06-05 18:10:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:06,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:06,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742010136] [2021-06-05 18:10:06,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742010136] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:06,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:06,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:10:06,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853430746] [2021-06-05 18:10:06,205 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:10:06,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:10:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:10:06,205 INFO L87 Difference]: Start difference. First operand 18802 states and 76758 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 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-06-05 18:10:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:07,628 INFO L93 Difference]: Finished difference Result 22538 states and 90032 transitions. [2021-06-05 18:10:07,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 18:10:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 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-06-05 18:10:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:07,679 INFO L225 Difference]: With dead ends: 22538 [2021-06-05 18:10:07,679 INFO L226 Difference]: Without dead ends: 21674 [2021-06-05 18:10:07,681 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1012.4ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 18:10:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21674 states. [2021-06-05 18:10:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21674 to 18952. [2021-06-05 18:10:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 18950 states have (on average 4.075092348284961) internal successors, (77223), 18951 states have internal predecessors, (77223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 77223 transitions. [2021-06-05 18:10:08,081 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 77223 transitions. Word has length 74 [2021-06-05 18:10:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:08,081 INFO L482 AbstractCegarLoop]: Abstraction has 18952 states and 77223 transitions. [2021-06-05 18:10:08,081 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 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-06-05 18:10:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 77223 transitions. [2021-06-05 18:10:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:08,106 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:08,106 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:08,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 18:10:08,106 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 447738003, now seen corresponding path program 3 times [2021-06-05 18:10:08,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:08,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128308468] [2021-06-05 18:10:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:08,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:08,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128308468] [2021-06-05 18:10:08,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128308468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:08,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:08,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 18:10:08,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130384357] [2021-06-05 18:10:08,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 18:10:08,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 18:10:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 18:10:08,522 INFO L87 Difference]: Start difference. First operand 18952 states and 77223 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 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-06-05 18:10:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:09,829 INFO L93 Difference]: Finished difference Result 22543 states and 89781 transitions. [2021-06-05 18:10:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:10:09,829 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 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-06-05 18:10:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:09,880 INFO L225 Difference]: With dead ends: 22543 [2021-06-05 18:10:09,880 INFO L226 Difference]: Without dead ends: 21679 [2021-06-05 18:10:09,880 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 893.4ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 18:10:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-06-05 18:10:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 19122. [2021-06-05 18:10:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19122 states, 19120 states have (on average 4.065585774058578) internal successors, (77734), 19121 states have internal predecessors, (77734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 77734 transitions. [2021-06-05 18:10:10,302 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 77734 transitions. Word has length 74 [2021-06-05 18:10:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:10,302 INFO L482 AbstractCegarLoop]: Abstraction has 19122 states and 77734 transitions. [2021-06-05 18:10:10,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 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-06-05 18:10:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 77734 transitions. [2021-06-05 18:10:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:10,326 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:10,326 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:10,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 18:10:10,326 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1081503733, now seen corresponding path program 4 times [2021-06-05 18:10:10,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:10,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947838198] [2021-06-05 18:10:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:10,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:10,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947838198] [2021-06-05 18:10:10,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947838198] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:10,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:10,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 18:10:10,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475118115] [2021-06-05 18:10:10,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 18:10:10,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 18:10:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:10:10,690 INFO L87 Difference]: Start difference. First operand 19122 states and 77734 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:11,785 INFO L93 Difference]: Finished difference Result 22763 states and 90402 transitions. [2021-06-05 18:10:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 18:10:11,785 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:11,835 INFO L225 Difference]: With dead ends: 22763 [2021-06-05 18:10:11,835 INFO L226 Difference]: Without dead ends: 21899 [2021-06-05 18:10:11,835 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 748.7ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 18:10:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2021-06-05 18:10:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 19172. [2021-06-05 18:10:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 19170 states have (on average 4.060719874804382) internal successors, (77844), 19171 states have internal predecessors, (77844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 77844 transitions. [2021-06-05 18:10:12,219 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 77844 transitions. Word has length 74 [2021-06-05 18:10:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:12,219 INFO L482 AbstractCegarLoop]: Abstraction has 19172 states and 77844 transitions. [2021-06-05 18:10:12,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 77844 transitions. [2021-06-05 18:10:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:12,242 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:12,242 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:12,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 18:10:12,243 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1223596091, now seen corresponding path program 5 times [2021-06-05 18:10:12,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:12,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570389872] [2021-06-05 18:10:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:12,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:12,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570389872] [2021-06-05 18:10:12,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570389872] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:12,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:12,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 18:10:12,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608890953] [2021-06-05 18:10:12,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 18:10:12,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 18:10:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 18:10:12,797 INFO L87 Difference]: Start difference. First operand 19172 states and 77844 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:13,523 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 18:10:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:14,607 INFO L93 Difference]: Finished difference Result 22885 states and 90632 transitions. [2021-06-05 18:10:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 18:10:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:14,658 INFO L225 Difference]: With dead ends: 22885 [2021-06-05 18:10:14,659 INFO L226 Difference]: Without dead ends: 22021 [2021-06-05 18:10:14,659 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1579.5ms TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:10:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22021 states. [2021-06-05 18:10:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22021 to 19193. [2021-06-05 18:10:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19191 states have (on average 4.058204366630191) internal successors, (77881), 19192 states have internal predecessors, (77881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 77881 transitions. [2021-06-05 18:10:15,074 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 77881 transitions. Word has length 74 [2021-06-05 18:10:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:15,074 INFO L482 AbstractCegarLoop]: Abstraction has 19193 states and 77881 transitions. [2021-06-05 18:10:15,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 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-06-05 18:10:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 77881 transitions. [2021-06-05 18:10:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:15,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:15,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:15,098 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 18:10:15,098 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1885361097, now seen corresponding path program 6 times [2021-06-05 18:10:15,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:15,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464214122] [2021-06-05 18:10:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:15,348 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:15,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464214122] [2021-06-05 18:10:15,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464214122] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:15,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:15,348 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 18:10:15,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313601311] [2021-06-05 18:10:15,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 18:10:15,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 18:10:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:10:15,349 INFO L87 Difference]: Start difference. First operand 19193 states and 77881 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:16,124 INFO L93 Difference]: Finished difference Result 22856 states and 90587 transitions. [2021-06-05 18:10:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 18:10:16,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:16,176 INFO L225 Difference]: With dead ends: 22856 [2021-06-05 18:10:16,176 INFO L226 Difference]: Without dead ends: 21992 [2021-06-05 18:10:16,177 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 502.9ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 18:10:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2021-06-05 18:10:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 19194. [2021-06-05 18:10:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19192 states have (on average 4.058045018757816) internal successors, (77882), 19193 states have internal predecessors, (77882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 77882 transitions. [2021-06-05 18:10:16,583 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 77882 transitions. Word has length 74 [2021-06-05 18:10:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:16,583 INFO L482 AbstractCegarLoop]: Abstraction has 19194 states and 77882 transitions. [2021-06-05 18:10:16,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 77882 transitions. [2021-06-05 18:10:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:16,606 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:16,607 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:16,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 18:10:16,607 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1675812887, now seen corresponding path program 7 times [2021-06-05 18:10:16,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:16,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792182625] [2021-06-05 18:10:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:16,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:16,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792182625] [2021-06-05 18:10:16,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792182625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:16,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:16,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 18:10:16,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379479626] [2021-06-05 18:10:16,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 18:10:16,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 18:10:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 18:10:16,865 INFO L87 Difference]: Start difference. First operand 19194 states and 77882 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:17,717 INFO L93 Difference]: Finished difference Result 22886 states and 90633 transitions. [2021-06-05 18:10:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 18:10:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:17,778 INFO L225 Difference]: With dead ends: 22886 [2021-06-05 18:10:17,778 INFO L226 Difference]: Without dead ends: 22022 [2021-06-05 18:10:17,778 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 452.4ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-06-05 18:10:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2021-06-05 18:10:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19223. [2021-06-05 18:10:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19221 states have (on average 4.054263565891473) internal successors, (77927), 19222 states have internal predecessors, (77927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 77927 transitions. [2021-06-05 18:10:18,161 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 77927 transitions. Word has length 74 [2021-06-05 18:10:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:18,162 INFO L482 AbstractCegarLoop]: Abstraction has 19223 states and 77927 transitions. [2021-06-05 18:10:18,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 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-06-05 18:10:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 77927 transitions. [2021-06-05 18:10:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 18:10:18,185 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:18,185 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:18,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 18:10:18,185 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1475525857, now seen corresponding path program 8 times [2021-06-05 18:10:18,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:18,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416510754] [2021-06-05 18:10:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:18,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:18,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416510754] [2021-06-05 18:10:18,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416510754] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:18,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:18,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 18:10:18,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112239151] [2021-06-05 18:10:18,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 18:10:18,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 18:10:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-06-05 18:10:18,417 INFO L87 Difference]: Start difference. First operand 19223 states and 77927 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-06-05 18:10:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:18,843 INFO L93 Difference]: Finished difference Result 21916 states and 86727 transitions. [2021-06-05 18:10:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 18:10:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-06-05 18:10:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:18,893 INFO L225 Difference]: With dead ends: 21916 [2021-06-05 18:10:18,893 INFO L226 Difference]: Without dead ends: 21052 [2021-06-05 18:10:18,894 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 272.6ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 18:10:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2021-06-05 18:10:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 18224. [2021-06-05 18:10:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-05 18:10:19,274 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 74 [2021-06-05 18:10:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:19,274 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-05 18:10:19,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 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-06-05 18:10:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-05 18:10:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 18:10:19,300 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:19,300 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:19,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 18:10:19,300 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1183741372, now seen corresponding path program 1 times [2021-06-05 18:10:19,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:19,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716476158] [2021-06-05 18:10:19,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:19,589 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-06-05 18:10:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:20,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:20,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716476158] [2021-06-05 18:10:20,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716476158] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:20,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:20,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 18:10:20,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309893816] [2021-06-05 18:10:20,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 18:10:20,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 18:10:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 18:10:20,192 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:22,171 INFO L93 Difference]: Finished difference Result 23749 states and 93878 transitions. [2021-06-05 18:10:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 18:10:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 76 [2021-06-05 18:10:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:22,226 INFO L225 Difference]: With dead ends: 23749 [2021-06-05 18:10:22,226 INFO L226 Difference]: Without dead ends: 23065 [2021-06-05 18:10:22,227 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1545.2ms TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 18:10:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2021-06-05 18:10:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 18224. [2021-06-05 18:10:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-05 18:10:22,711 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 76 [2021-06-05 18:10:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:22,711 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-05 18:10:22,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-05 18:10:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 18:10:22,736 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:22,737 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:22,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 18:10:22,737 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -342292756, now seen corresponding path program 2 times [2021-06-05 18:10:22,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:22,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379257426] [2021-06-05 18:10:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:23,275 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:23,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379257426] [2021-06-05 18:10:23,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379257426] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:23,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:23,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 18:10:23,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096757342] [2021-06-05 18:10:23,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 18:10:23,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 18:10:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-06-05 18:10:23,276 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:24,720 INFO L93 Difference]: Finished difference Result 22030 states and 86807 transitions. [2021-06-05 18:10:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 18:10:24,721 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 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 76 [2021-06-05 18:10:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:24,769 INFO L225 Difference]: With dead ends: 22030 [2021-06-05 18:10:24,769 INFO L226 Difference]: Without dead ends: 21346 [2021-06-05 18:10:24,770 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1009.5ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 18:10:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2021-06-05 18:10:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 16478. [2021-06-05 18:10:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-05 18:10:25,101 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-05 18:10:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:25,101 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-05 18:10:25,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-05 18:10:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 18:10:25,124 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:25,124 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:25,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 18:10:25,124 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1885510190, now seen corresponding path program 3 times [2021-06-05 18:10:25,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:25,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694242067] [2021-06-05 18:10:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:25,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:25,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694242067] [2021-06-05 18:10:25,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694242067] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:25,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:25,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-05 18:10:25,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080516822] [2021-06-05 18:10:25,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 18:10:25,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 18:10:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-06-05 18:10:25,572 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:26,787 INFO L93 Difference]: Finished difference Result 21346 states and 84263 transitions. [2021-06-05 18:10:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 18:10:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 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 76 [2021-06-05 18:10:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:26,835 INFO L225 Difference]: With dead ends: 21346 [2021-06-05 18:10:26,835 INFO L226 Difference]: Without dead ends: 21004 [2021-06-05 18:10:26,835 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 768.6ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 18:10:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21004 states. [2021-06-05 18:10:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21004 to 16478. [2021-06-05 18:10:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-05 18:10:27,156 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-05 18:10:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:27,156 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-05 18:10:27,156 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-05 18:10:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 18:10:27,178 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:27,178 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:27,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 18:10:27,179 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash -171521702, now seen corresponding path program 4 times [2021-06-05 18:10:27,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:27,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869643114] [2021-06-05 18:10:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:10:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:10:27,552 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:10:27,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869643114] [2021-06-05 18:10:27,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869643114] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:10:27,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:10:27,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 18:10:27,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492710831] [2021-06-05 18:10:27,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 18:10:27,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:10:27,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 18:10:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 18:10:27,553 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:10:28,577 INFO L93 Difference]: Finished difference Result 16265 states and 64818 transitions. [2021-06-05 18:10:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 18:10:28,578 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 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 76 [2021-06-05 18:10:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:10:28,614 INFO L225 Difference]: With dead ends: 16265 [2021-06-05 18:10:28,614 INFO L226 Difference]: Without dead ends: 15923 [2021-06-05 18:10:28,614 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 673.6ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 18:10:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-06-05 18:10:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 11363. [2021-06-05 18:10:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11362 states have (on average 4.191867628938567) internal successors, (47628), 11362 states have internal predecessors, (47628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 47628 transitions. [2021-06-05 18:10:28,935 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 47628 transitions. Word has length 76 [2021-06-05 18:10:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:10:28,935 INFO L482 AbstractCegarLoop]: Abstraction has 11363 states and 47628 transitions. [2021-06-05 18:10:28,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 47628 transitions. [2021-06-05 18:10:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 18:10:28,954 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:10:28,954 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:10:28,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 18:10:28,954 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:10:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:10:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 530227372, now seen corresponding path program 1 times [2021-06-05 18:10:28,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:10:28,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709439082] [2021-06-05 18:10:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:10:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 18:10:28,981 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 18:10:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 18:10:28,995 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 18:10:29,029 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 18:10:29,029 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 18:10:29,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 18:10:29,029 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 18:10:29,030 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 18:10:29,031 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:10:29,031 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:10:29,031 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:10:29,031 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:10:29,031 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:10:29,031 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:10:29,031 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:10:29,031 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread0Thread1of1ForFork4======== [2021-06-05 18:10:29,033 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-06-05 18:10:34,884 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:10:35,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 18:10:35,122 INFO L301 ceAbstractionStarter]: Result for error location thread0Thread1of1ForFork4 was SAFE (3/3) [2021-06-05 18:10:35,122 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 18:10:35,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 06:10:35 BasicIcfg [2021-06-05 18:10:35,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 18:10:35,213 INFO L168 Benchmark]: Toolchain (without parser) took 169427.99 ms. Allocated memory was 379.6 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 341.9 MB in the beginning and 14.1 GB in the end (delta: -13.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 379.6 MB. Free memory was 360.7 MB in the beginning and 360.6 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.21 ms. Allocated memory is still 379.6 MB. Free memory was 341.7 MB in the beginning and 303.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.13 ms. Allocated memory is still 379.6 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: Boogie Preprocessor took 26.76 ms. Allocated memory is still 379.6 MB. Free memory was 301.0 MB in the beginning and 299.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: RCFGBuilder took 424.01 ms. Allocated memory is still 379.6 MB. Free memory was 299.8 MB in the beginning and 269.6 MB in the end (delta: 30.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 INFO L168 Benchmark]: TraceAbstraction took 168388.25 ms. Allocated memory was 379.6 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 268.7 MB in the beginning and 14.1 GB in the end (delta: -13.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 18:10:35,213 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.12 ms. Allocated memory is still 379.6 MB. Free memory was 360.7 MB in the beginning and 360.6 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 531.21 ms. Allocated memory is still 379.6 MB. Free memory was 341.7 MB in the beginning and 303.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 52.13 ms. Allocated memory is still 379.6 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.76 ms. Allocated memory is still 379.6 MB. Free memory was 301.0 MB in the beginning and 299.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 424.01 ms. Allocated memory is still 379.6 MB. Free memory was 299.8 MB in the beginning and 269.6 MB in the end (delta: 30.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 168388.25 ms. Allocated memory was 379.6 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 268.7 MB in the beginning and 14.1 GB in the end (delta: -13.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-5, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-5, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [\read(t1)=-5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1128] 2 return 0; VAL [\read(t1)=-5, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-5, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t2, 0, thread2, 0)=-4, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t3, 0, thread3, 0)=-3, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1142] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=-3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=-3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=-2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=-2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1163] 0 \read(t) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1164] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread0 with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6636.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 580.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6052.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 155220.2ms, OverallIterations: 50, TraceHistogramMax: 1, EmptinessCheckTime: 1173.2ms, AutomataDifference: 71242.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5317.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11609 SDtfs, 19453 SDslu, 102341 SDs, 0 SdLazy, 47139 SolverSat, 2542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23727.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1674 GetRequests, 105 SyntacticMatches, 131 SemanticMatches, 1438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9148 ImplicationChecksByTransitivity, 33886.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 1079, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 58161.7ms AutomataMinimizationTime, 49 MinimizatonAttempts, 324349 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 113.1ms SsaConstructionTime, 454.9ms SatisfiabilityAnalysisTime, 18338.4ms InterpolantComputationTime, 3365 NumberOfCodeBlocks, 3365 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3206 ConstructedInterpolants, 0 QuantifiedInterpolants, 71887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread0Thread1of1ForFork4 with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6091.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 237.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5853.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...