./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7df3f42c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/singleton.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 692248c827814d69f794d70185d48fd053222a0c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7df3f42 [2020-12-01 17:33:45,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:33:45,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:33:45,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:33:45,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:33:45,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:33:45,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:33:45,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:33:45,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:33:45,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:33:45,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:33:45,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:33:45,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:33:45,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:33:45,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:33:45,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:33:45,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:33:45,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:33:45,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:33:45,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:33:45,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:33:45,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:33:45,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:33:45,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:33:45,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:33:45,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:33:45,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:33:45,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:33:45,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:33:45,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:33:45,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:33:45,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:33:45,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:33:45,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:33:45,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:33:45,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:33:45,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:33:45,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:33:45,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:33:45,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:33:45,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:33:45,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 17:33:45,227 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:33:45,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:33:45,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:33:45,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:33:45,230 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 17:33:45,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:33:45,231 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:33:45,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:33:45,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:33:45,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:33:45,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:33:45,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:33:45,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:33:45,233 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:33:45,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:33:45,233 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:33:45,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:33:45,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:33:45,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 17:33:45,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:33:45,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 17:33:45,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 17:33:45,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:33:45,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:33:45,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:33:45,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 17:33:45,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:33:45,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:33:45,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 17:33:45,237 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 692248c827814d69f794d70185d48fd053222a0c [2020-12-01 17:33:45,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:33:45,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:33:45,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:33:45,652 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:33:45,654 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:33:45,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-01 17:33:45,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2313457/fab1c396edbe408c9f33d70807f2d705/FLAG051512b39 [2020-12-01 17:33:46,469 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:33:46,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-01 17:33:46,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2313457/fab1c396edbe408c9f33d70807f2d705/FLAG051512b39 [2020-12-01 17:33:46,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2313457/fab1c396edbe408c9f33d70807f2d705 [2020-12-01 17:33:46,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:33:46,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:33:46,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:33:46,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:33:46,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:33:46,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:33:46" (1/1) ... [2020-12-01 17:33:46,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697f20f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:46, skipping insertion in model container [2020-12-01 17:33:46,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:33:46" (1/1) ... [2020-12-01 17:33:46,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:33:46,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:33:47,007 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-01 17:33:47,270 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-01 17:33:47,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:33:47,344 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:33:47,364 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-01 17:33:47,391 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-01 17:33:47,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:33:47,630 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:33:47,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47 WrapperNode [2020-12-01 17:33:47,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:33:47,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:33:47,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:33:47,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:33:47,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:33:47,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:33:47,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:33:47,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:33:47,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... [2020-12-01 17:33:47,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:33:47,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:33:47,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:33:47,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:33:47,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 17:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 17:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 17:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 17:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-01 17:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-01 17:33:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-01 17:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-01 17:33:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-01 17:33:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-01 17:33:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-01 17:33:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-01 17:33:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-01 17:33:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 17:33:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-01 17:33:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:33:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:33:47,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:33:47,879 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 17:33:48,343 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:33:48,344 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-01 17:33:48,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:48 BoogieIcfgContainer [2020-12-01 17:33:48,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:33:48,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 17:33:48,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 17:33:48,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 17:33:48,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:33:46" (1/3) ... [2020-12-01 17:33:48,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278d8c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:33:48, skipping insertion in model container [2020-12-01 17:33:48,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:47" (2/3) ... [2020-12-01 17:33:48,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278d8c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:33:48, skipping insertion in model container [2020-12-01 17:33:48,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:48" (3/3) ... [2020-12-01 17:33:48,360 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-01 17:33:48,382 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 17:33:48,383 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 17:33:48,387 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-01 17:33:48,387 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 17:33:48,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,435 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,436 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,436 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,437 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,438 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,439 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,439 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,440 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,440 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,440 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,441 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,442 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,442 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,442 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,442 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,443 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,444 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,445 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,446 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,447 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,448 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,449 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,449 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,449 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,449 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,450 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,450 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,450 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,451 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,451 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,451 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,452 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,452 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,452 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,453 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,453 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,453 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,453 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,454 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,454 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,454 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,455 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,455 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,455 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,456 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,456 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,456 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,456 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,457 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,457 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,457 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,457 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,458 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,458 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,458 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,459 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,459 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,459 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,459 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,460 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,460 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,460 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,461 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,461 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,461 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,461 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,462 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,462 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,462 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,463 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,463 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,463 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,463 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,464 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,464 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,464 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,465 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,465 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,465 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,465 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,466 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,466 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,466 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,466 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,471 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,471 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,471 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,471 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,472 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,472 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,472 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,473 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,473 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,473 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,473 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,474 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,474 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,474 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,475 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,475 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,475 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,475 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,476 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,476 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,476 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,477 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,477 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,478 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,478 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,478 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,478 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,479 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,479 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,480 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,480 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,480 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,480 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,481 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,481 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,481 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,482 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,482 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,482 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,483 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,483 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,483 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,483 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,484 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,484 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,484 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,485 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,485 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,485 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,486 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,486 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,486 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,486 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,487 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,487 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,487 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,488 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,488 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,488 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,489 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,489 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,489 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,489 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,490 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,490 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,490 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,491 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,491 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,491 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,492 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,492 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,492 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,492 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,493 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,493 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,493 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,493 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,494 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,494 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,494 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,495 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,497 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,498 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,498 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,499 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,505 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,505 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,506 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,506 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,508 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,509 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,509 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,509 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,511 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,512 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,512 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,513 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,513 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,513 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,516 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,516 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,516 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,517 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,517 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,517 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,517 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,518 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,518 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,518 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,518 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,519 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,519 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,519 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,519 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,520 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,520 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,520 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,520 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,521 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,521 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,521 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,521 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,522 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,524 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,525 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,525 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,525 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,527 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,528 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,528 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,528 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,529 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,529 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,531 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,531 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,532 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,532 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,534 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,535 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,535 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,535 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,541 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,542 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,542 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,542 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,545 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,546 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 17:33:48,726 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-01 17:33:48,740 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-01 17:33:48,765 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 17:33:48,765 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 17:33:48,765 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 17:33:48,766 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 17:33:48,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 17:33:48,766 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 17:33:48,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 17:33:48,766 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 17:33:48,786 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 17:33:48,789 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-01 17:33:48,793 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-01 17:33:48,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-01 17:33:48,918 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-01 17:33:48,918 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-01 17:33:48,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-01 17:33:48,942 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-01 17:33:51,867 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-01 17:33:52,083 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-01 17:33:52,187 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-01 17:33:52,590 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-01 17:33:52,799 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-01 17:33:52,966 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-01 17:33:53,081 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-01 17:33:53,198 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-01 17:33:53,316 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-01 17:33:53,589 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-01 17:33:53,589 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-01 17:33:53,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-01 17:33:54,209 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-01 17:33:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-01 17:33:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:33:54,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:54,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:54,219 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-01 17:33:54,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:54,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768812318] [2020-12-01 17:33:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:54,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768812318] [2020-12-01 17:33:54,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:54,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:33:54,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220662544] [2020-12-01 17:33:54,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:33:54,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:33:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:33:54,720 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-01 17:33:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:55,100 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-01 17:33:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:33:55,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-01 17:33:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:55,193 INFO L225 Difference]: With dead ends: 6012 [2020-12-01 17:33:55,193 INFO L226 Difference]: Without dead ends: 5524 [2020-12-01 17:33:55,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:33:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-01 17:33:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-01 17:33:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-01 17:33:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-01 17:33:55,502 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-01 17:33:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:55,503 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-01 17:33:55,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:33:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-01 17:33:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:33:55,504 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:55,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:55,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 17:33:55,505 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-01 17:33:55,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:55,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265780782] [2020-12-01 17:33:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:55,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265780782] [2020-12-01 17:33:55,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:55,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:33:55,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352241843] [2020-12-01 17:33:55,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:33:55,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:33:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:33:55,627 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-01 17:33:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:55,875 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-01 17:33:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 17:33:55,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-01 17:33:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:55,922 INFO L225 Difference]: With dead ends: 4266 [2020-12-01 17:33:55,923 INFO L226 Difference]: Without dead ends: 4266 [2020-12-01 17:33:55,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:33:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-01 17:33:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-01 17:33:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-01 17:33:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-01 17:33:56,107 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-01 17:33:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:56,107 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-01 17:33:56,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:33:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-01 17:33:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 17:33:56,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:56,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:56,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 17:33:56,111 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-01 17:33:56,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:56,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256536579] [2020-12-01 17:33:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:56,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256536579] [2020-12-01 17:33:56,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:56,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 17:33:56,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729047847] [2020-12-01 17:33:56,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 17:33:56,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 17:33:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 17:33:56,218 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-01 17:33:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:56,363 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-01 17:33:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 17:33:56,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-01 17:33:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:56,413 INFO L225 Difference]: With dead ends: 4848 [2020-12-01 17:33:56,413 INFO L226 Difference]: Without dead ends: 3558 [2020-12-01 17:33:56,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 17:33:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-01 17:33:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-01 17:33:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-01 17:33:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-01 17:33:56,555 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-01 17:33:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:56,556 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-01 17:33:56,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 17:33:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-01 17:33:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 17:33:56,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:56,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:56,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 17:33:56,561 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-01 17:33:56,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:56,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188309138] [2020-12-01 17:33:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:56,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188309138] [2020-12-01 17:33:56,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:56,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:33:56,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833842203] [2020-12-01 17:33:56,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:33:56,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:33:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:33:56,710 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-01 17:33:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:56,951 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-01 17:33:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:33:56,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-01 17:33:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:56,974 INFO L225 Difference]: With dead ends: 4417 [2020-12-01 17:33:56,974 INFO L226 Difference]: Without dead ends: 4393 [2020-12-01 17:33:56,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:33:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-01 17:33:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-01 17:33:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-01 17:33:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-01 17:33:57,171 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-01 17:33:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:57,171 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-01 17:33:57,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:33:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-01 17:33:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 17:33:57,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:57,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:57,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 17:33:57,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-01 17:33:57,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:57,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775165517] [2020-12-01 17:33:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:57,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775165517] [2020-12-01 17:33:57,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:57,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:33:57,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231305113] [2020-12-01 17:33:57,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:33:57,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:33:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:33:57,307 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-01 17:33:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:57,442 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-01 17:33:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:33:57,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-01 17:33:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:57,463 INFO L225 Difference]: With dead ends: 4024 [2020-12-01 17:33:57,464 INFO L226 Difference]: Without dead ends: 4024 [2020-12-01 17:33:57,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:33:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-01 17:33:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-01 17:33:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-01 17:33:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-01 17:33:57,662 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-01 17:33:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:57,664 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-01 17:33:57,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:33:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-01 17:33:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 17:33:57,666 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:57,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:57,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 17:33:57,666 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-01 17:33:57,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:57,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570518927] [2020-12-01 17:33:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:57,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570518927] [2020-12-01 17:33:57,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:57,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:33:57,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943102210] [2020-12-01 17:33:57,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:33:57,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:33:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:33:57,752 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-01 17:33:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:57,965 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-01 17:33:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:33:57,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-01 17:33:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:57,986 INFO L225 Difference]: With dead ends: 4225 [2020-12-01 17:33:57,987 INFO L226 Difference]: Without dead ends: 4129 [2020-12-01 17:33:57,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:33:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-01 17:33:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-01 17:33:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-01 17:33:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-01 17:33:58,208 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-01 17:33:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:58,209 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-01 17:33:58,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:33:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-01 17:33:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 17:33:58,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:58,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:58,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 17:33:58,211 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-01 17:33:58,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:58,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546620919] [2020-12-01 17:33:58,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:58,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546620919] [2020-12-01 17:33:58,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:58,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:33:58,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883113257] [2020-12-01 17:33:58,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:33:58,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:33:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:33:58,367 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-01 17:33:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:58,813 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-01 17:33:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 17:33:58,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-01 17:33:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:58,839 INFO L225 Difference]: With dead ends: 4979 [2020-12-01 17:33:58,840 INFO L226 Difference]: Without dead ends: 4905 [2020-12-01 17:33:58,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:33:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-01 17:33:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-01 17:33:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-01 17:33:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-01 17:33:59,028 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-01 17:33:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:59,029 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-01 17:33:59,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:33:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-01 17:33:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 17:33:59,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:59,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:59,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 17:33:59,031 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-01 17:33:59,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:59,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692832606] [2020-12-01 17:33:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:59,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692832606] [2020-12-01 17:33:59,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:59,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:33:59,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8003053] [2020-12-01 17:33:59,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 17:33:59,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 17:33:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:33:59,170 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-01 17:33:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:33:59,655 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-01 17:33:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:33:59,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-01 17:33:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:33:59,686 INFO L225 Difference]: With dead ends: 6735 [2020-12-01 17:33:59,687 INFO L226 Difference]: Without dead ends: 6661 [2020-12-01 17:33:59,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:33:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-01 17:33:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-01 17:33:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-01 17:33:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-01 17:33:59,866 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-01 17:33:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:33:59,867 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-01 17:33:59,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 17:33:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-01 17:33:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 17:33:59,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:33:59,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:33:59,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 17:33:59,869 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:33:59,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:33:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-01 17:33:59,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:33:59,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166730827] [2020-12-01 17:33:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:33:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:33:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:33:59,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166730827] [2020-12-01 17:33:59,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:33:59,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:33:59,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55409969] [2020-12-01 17:33:59,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 17:33:59,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:33:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 17:33:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:33:59,970 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-01 17:34:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:00,340 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-01 17:34:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:00,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-01 17:34:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:00,361 INFO L225 Difference]: With dead ends: 5385 [2020-12-01 17:34:00,361 INFO L226 Difference]: Without dead ends: 5311 [2020-12-01 17:34:00,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-01 17:34:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-01 17:34:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-01 17:34:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-01 17:34:00,514 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-01 17:34:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:00,515 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-01 17:34:00,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 17:34:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-01 17:34:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 17:34:00,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:00,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:00,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 17:34:00,517 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-01 17:34:00,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:00,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425607602] [2020-12-01 17:34:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:00,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425607602] [2020-12-01 17:34:00,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:00,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 17:34:00,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792644930] [2020-12-01 17:34:00,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 17:34:00,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 17:34:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:00,787 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-01 17:34:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:01,584 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-01 17:34:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 17:34:01,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-01 17:34:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:01,605 INFO L225 Difference]: With dead ends: 5686 [2020-12-01 17:34:01,605 INFO L226 Difference]: Without dead ends: 5630 [2020-12-01 17:34:01,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-01 17:34:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-01 17:34:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-01 17:34:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-01 17:34:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-01 17:34:01,759 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-01 17:34:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:01,759 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-01 17:34:01,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 17:34:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-01 17:34:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:34:01,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:01,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:01,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 17:34:01,761 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-01 17:34:01,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:01,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755561843] [2020-12-01 17:34:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:01,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755561843] [2020-12-01 17:34:01,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:01,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:34:01,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490406719] [2020-12-01 17:34:01,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:34:01,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:34:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:34:01,815 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-01 17:34:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:01,925 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-01 17:34:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:34:01,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-01 17:34:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:01,937 INFO L225 Difference]: With dead ends: 4687 [2020-12-01 17:34:01,937 INFO L226 Difference]: Without dead ends: 4687 [2020-12-01 17:34:01,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-01 17:34:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-01 17:34:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-01 17:34:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-01 17:34:02,124 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-01 17:34:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:02,124 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-01 17:34:02,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:34:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-01 17:34:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:34:02,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:02,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:02,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 17:34:02,127 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-01 17:34:02,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:02,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236077178] [2020-12-01 17:34:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:02,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236077178] [2020-12-01 17:34:02,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:02,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 17:34:02,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87771862] [2020-12-01 17:34:02,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 17:34:02,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 17:34:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-01 17:34:02,219 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-01 17:34:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:02,336 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-01 17:34:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:34:02,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-01 17:34:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:02,351 INFO L225 Difference]: With dead ends: 4619 [2020-12-01 17:34:02,352 INFO L226 Difference]: Without dead ends: 4619 [2020-12-01 17:34:02,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:34:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-01 17:34:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-01 17:34:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-01 17:34:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-01 17:34:02,494 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-01 17:34:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:02,494 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-01 17:34:02,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 17:34:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-01 17:34:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:34:02,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:02,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:02,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 17:34:02,497 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-01 17:34:02,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:02,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699090248] [2020-12-01 17:34:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:02,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699090248] [2020-12-01 17:34:02,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:02,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:02,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305240875] [2020-12-01 17:34:02,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:02,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:02,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:02,684 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-01 17:34:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:03,315 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-01 17:34:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:03,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-01 17:34:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:03,337 INFO L225 Difference]: With dead ends: 5300 [2020-12-01 17:34:03,337 INFO L226 Difference]: Without dead ends: 5226 [2020-12-01 17:34:03,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:34:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-01 17:34:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-01 17:34:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-01 17:34:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-01 17:34:03,506 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-01 17:34:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:03,506 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-01 17:34:03,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-01 17:34:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:34:03,510 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:03,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:03,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 17:34:03,511 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-01 17:34:03,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:03,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398729117] [2020-12-01 17:34:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:03,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398729117] [2020-12-01 17:34:03,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:03,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:03,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843894860] [2020-12-01 17:34:03,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:03,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:03,818 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-01 17:34:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:04,377 INFO L93 Difference]: Finished difference Result 5678 states and 23523 transitions. [2020-12-01 17:34:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:04,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-01 17:34:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:04,399 INFO L225 Difference]: With dead ends: 5678 [2020-12-01 17:34:04,399 INFO L226 Difference]: Without dead ends: 5616 [2020-12-01 17:34:04,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2020-12-01 17:34:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4013. [2020-12-01 17:34:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-12-01 17:34:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-12-01 17:34:04,566 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-12-01 17:34:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:04,566 INFO L481 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-12-01 17:34:04,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-12-01 17:34:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:04,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:04,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:04,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 17:34:04,572 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-01 17:34:04,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:04,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184391294] [2020-12-01 17:34:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:04,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184391294] [2020-12-01 17:34:04,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:04,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:04,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632556710] [2020-12-01 17:34:04,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:04,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:04,675 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 8 states. [2020-12-01 17:34:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:05,052 INFO L93 Difference]: Finished difference Result 6232 states and 25250 transitions. [2020-12-01 17:34:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:05,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-01 17:34:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:05,070 INFO L225 Difference]: With dead ends: 6232 [2020-12-01 17:34:05,070 INFO L226 Difference]: Without dead ends: 6186 [2020-12-01 17:34:05,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-01 17:34:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2020-12-01 17:34:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 4012. [2020-12-01 17:34:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2020-12-01 17:34:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16197 transitions. [2020-12-01 17:34:05,214 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16197 transitions. Word has length 20 [2020-12-01 17:34:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:05,214 INFO L481 AbstractCegarLoop]: Abstraction has 4012 states and 16197 transitions. [2020-12-01 17:34:05,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16197 transitions. [2020-12-01 17:34:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:05,217 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:05,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:05,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 17:34:05,218 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-01 17:34:05,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:05,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164398663] [2020-12-01 17:34:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:05,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164398663] [2020-12-01 17:34:05,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:05,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:05,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569642549] [2020-12-01 17:34:05,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:05,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:05,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:05,292 INFO L87 Difference]: Start difference. First operand 4012 states and 16197 transitions. Second operand 8 states. [2020-12-01 17:34:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:05,543 INFO L93 Difference]: Finished difference Result 5049 states and 20218 transitions. [2020-12-01 17:34:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:05,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-01 17:34:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:05,556 INFO L225 Difference]: With dead ends: 5049 [2020-12-01 17:34:05,557 INFO L226 Difference]: Without dead ends: 5003 [2020-12-01 17:34:05,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2020-12-01 17:34:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 4009. [2020-12-01 17:34:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2020-12-01 17:34:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 16190 transitions. [2020-12-01 17:34:05,682 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 16190 transitions. Word has length 20 [2020-12-01 17:34:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:05,683 INFO L481 AbstractCegarLoop]: Abstraction has 4009 states and 16190 transitions. [2020-12-01 17:34:05,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 16190 transitions. [2020-12-01 17:34:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:05,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:05,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:05,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 17:34:05,686 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-01 17:34:05,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:05,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209803886] [2020-12-01 17:34:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:05,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209803886] [2020-12-01 17:34:05,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:05,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:34:05,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001029635] [2020-12-01 17:34:05,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 17:34:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 17:34:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:34:05,821 INFO L87 Difference]: Start difference. First operand 4009 states and 16190 transitions. Second operand 9 states. [2020-12-01 17:34:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:06,300 INFO L93 Difference]: Finished difference Result 5039 states and 20194 transitions. [2020-12-01 17:34:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:06,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-01 17:34:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:06,316 INFO L225 Difference]: With dead ends: 5039 [2020-12-01 17:34:06,316 INFO L226 Difference]: Without dead ends: 4993 [2020-12-01 17:34:06,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-01 17:34:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2020-12-01 17:34:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4002. [2020-12-01 17:34:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4002 states. [2020-12-01 17:34:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 16171 transitions. [2020-12-01 17:34:06,439 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 16171 transitions. Word has length 20 [2020-12-01 17:34:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:06,440 INFO L481 AbstractCegarLoop]: Abstraction has 4002 states and 16171 transitions. [2020-12-01 17:34:06,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 17:34:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 16171 transitions. [2020-12-01 17:34:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:06,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:06,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:06,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 17:34:06,444 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-01 17:34:06,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:06,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492925516] [2020-12-01 17:34:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:06,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492925516] [2020-12-01 17:34:06,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:06,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 17:34:06,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331508550] [2020-12-01 17:34:06,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 17:34:06,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 17:34:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:06,678 INFO L87 Difference]: Start difference. First operand 4002 states and 16171 transitions. Second operand 11 states. [2020-12-01 17:34:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:07,394 INFO L93 Difference]: Finished difference Result 5519 states and 22271 transitions. [2020-12-01 17:34:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 17:34:07,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-01 17:34:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:07,409 INFO L225 Difference]: With dead ends: 5519 [2020-12-01 17:34:07,409 INFO L226 Difference]: Without dead ends: 5473 [2020-12-01 17:34:07,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-01 17:34:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2020-12-01 17:34:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 4119. [2020-12-01 17:34:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2020-12-01 17:34:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 16768 transitions. [2020-12-01 17:34:07,530 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 16768 transitions. Word has length 20 [2020-12-01 17:34:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:07,531 INFO L481 AbstractCegarLoop]: Abstraction has 4119 states and 16768 transitions. [2020-12-01 17:34:07,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 17:34:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 16768 transitions. [2020-12-01 17:34:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:07,534 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:07,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:07,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 17:34:07,535 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-01 17:34:07,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:07,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627649641] [2020-12-01 17:34:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:07,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627649641] [2020-12-01 17:34:07,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:07,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 17:34:07,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314433404] [2020-12-01 17:34:07,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 17:34:07,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 17:34:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:07,755 INFO L87 Difference]: Start difference. First operand 4119 states and 16768 transitions. Second operand 11 states. [2020-12-01 17:34:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:08,532 INFO L93 Difference]: Finished difference Result 6134 states and 24577 transitions. [2020-12-01 17:34:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-01 17:34:08,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-01 17:34:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:08,548 INFO L225 Difference]: With dead ends: 6134 [2020-12-01 17:34:08,548 INFO L226 Difference]: Without dead ends: 6088 [2020-12-01 17:34:08,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-01 17:34:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6088 states. [2020-12-01 17:34:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6088 to 4119. [2020-12-01 17:34:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2020-12-01 17:34:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 16769 transitions. [2020-12-01 17:34:08,640 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 16769 transitions. Word has length 20 [2020-12-01 17:34:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:08,640 INFO L481 AbstractCegarLoop]: Abstraction has 4119 states and 16769 transitions. [2020-12-01 17:34:08,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 17:34:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 16769 transitions. [2020-12-01 17:34:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:34:08,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:08,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:08,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 17:34:08,645 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 2 times [2020-12-01 17:34:08,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:08,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453282191] [2020-12-01 17:34:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:08,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453282191] [2020-12-01 17:34:08,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:08,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:08,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702453048] [2020-12-01 17:34:08,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:08,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:08,780 INFO L87 Difference]: Start difference. First operand 4119 states and 16769 transitions. Second operand 10 states. [2020-12-01 17:34:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:09,227 INFO L93 Difference]: Finished difference Result 5788 states and 23123 transitions. [2020-12-01 17:34:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 17:34:09,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-01 17:34:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:09,243 INFO L225 Difference]: With dead ends: 5788 [2020-12-01 17:34:09,244 INFO L226 Difference]: Without dead ends: 5742 [2020-12-01 17:34:09,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-01 17:34:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2020-12-01 17:34:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 3948. [2020-12-01 17:34:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-12-01 17:34:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-12-01 17:34:09,340 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-12-01 17:34:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:09,340 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-12-01 17:34:09,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-12-01 17:34:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:09,343 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:09,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:09,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 17:34:09,344 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-01 17:34:09,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:09,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323998128] [2020-12-01 17:34:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:09,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323998128] [2020-12-01 17:34:09,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:09,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:34:09,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075655393] [2020-12-01 17:34:09,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:34:09,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:34:09,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:34:09,390 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 6 states. [2020-12-01 17:34:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:09,577 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2020-12-01 17:34:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:09,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-01 17:34:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:09,589 INFO L225 Difference]: With dead ends: 4727 [2020-12-01 17:34:09,589 INFO L226 Difference]: Without dead ends: 4652 [2020-12-01 17:34:09,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2020-12-01 17:34:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2020-12-01 17:34:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-12-01 17:34:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-12-01 17:34:09,708 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-12-01 17:34:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:09,708 INFO L481 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-12-01 17:34:09,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:34:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-12-01 17:34:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:09,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:09,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:09,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 17:34:09,718 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-01 17:34:09,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:09,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300225001] [2020-12-01 17:34:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:09,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300225001] [2020-12-01 17:34:09,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:09,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:34:09,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661670760] [2020-12-01 17:34:09,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:34:09,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:34:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:34:09,772 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 6 states. [2020-12-01 17:34:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:09,884 INFO L93 Difference]: Finished difference Result 5197 states and 20300 transitions. [2020-12-01 17:34:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:34:09,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-01 17:34:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:09,899 INFO L225 Difference]: With dead ends: 5197 [2020-12-01 17:34:09,899 INFO L226 Difference]: Without dead ends: 4674 [2020-12-01 17:34:09,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2020-12-01 17:34:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 3901. [2020-12-01 17:34:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-12-01 17:34:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 15421 transitions. [2020-12-01 17:34:10,007 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 15421 transitions. Word has length 21 [2020-12-01 17:34:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:10,008 INFO L481 AbstractCegarLoop]: Abstraction has 3901 states and 15421 transitions. [2020-12-01 17:34:10,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:34:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 15421 transitions. [2020-12-01 17:34:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:10,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:10,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:10,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 17:34:10,012 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-01 17:34:10,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:10,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269351644] [2020-12-01 17:34:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:10,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269351644] [2020-12-01 17:34:10,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:10,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:10,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888329417] [2020-12-01 17:34:10,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:10,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:10,196 INFO L87 Difference]: Start difference. First operand 3901 states and 15421 transitions. Second operand 10 states. [2020-12-01 17:34:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:10,810 INFO L93 Difference]: Finished difference Result 4702 states and 18452 transitions. [2020-12-01 17:34:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:10,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-01 17:34:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:10,822 INFO L225 Difference]: With dead ends: 4702 [2020-12-01 17:34:10,822 INFO L226 Difference]: Without dead ends: 4653 [2020-12-01 17:34:10,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:34:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2020-12-01 17:34:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3809. [2020-12-01 17:34:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2020-12-01 17:34:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 15047 transitions. [2020-12-01 17:34:10,900 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 15047 transitions. Word has length 21 [2020-12-01 17:34:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:10,900 INFO L481 AbstractCegarLoop]: Abstraction has 3809 states and 15047 transitions. [2020-12-01 17:34:10,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 15047 transitions. [2020-12-01 17:34:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:10,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:10,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:10,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 17:34:10,903 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-01 17:34:10,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:10,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263919950] [2020-12-01 17:34:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:11,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263919950] [2020-12-01 17:34:11,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:11,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:11,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379024105] [2020-12-01 17:34:11,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:11,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:11,189 INFO L87 Difference]: Start difference. First operand 3809 states and 15047 transitions. Second operand 12 states. [2020-12-01 17:34:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:12,149 INFO L93 Difference]: Finished difference Result 4136 states and 15962 transitions. [2020-12-01 17:34:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 17:34:12,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-01 17:34:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:12,165 INFO L225 Difference]: With dead ends: 4136 [2020-12-01 17:34:12,165 INFO L226 Difference]: Without dead ends: 3982 [2020-12-01 17:34:12,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-12-01 17:34:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2020-12-01 17:34:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3078. [2020-12-01 17:34:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3078 states. [2020-12-01 17:34:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 11544 transitions. [2020-12-01 17:34:12,275 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 11544 transitions. Word has length 21 [2020-12-01 17:34:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:12,276 INFO L481 AbstractCegarLoop]: Abstraction has 3078 states and 11544 transitions. [2020-12-01 17:34:12,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 11544 transitions. [2020-12-01 17:34:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:12,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:12,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:12,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 17:34:12,278 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-01 17:34:12,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:12,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890422575] [2020-12-01 17:34:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:12,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890422575] [2020-12-01 17:34:12,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:12,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:12,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316279084] [2020-12-01 17:34:12,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:12,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:12,565 INFO L87 Difference]: Start difference. First operand 3078 states and 11544 transitions. Second operand 12 states. [2020-12-01 17:34:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:13,208 INFO L93 Difference]: Finished difference Result 4170 states and 15858 transitions. [2020-12-01 17:34:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:13,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-01 17:34:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:13,227 INFO L225 Difference]: With dead ends: 4170 [2020-12-01 17:34:13,228 INFO L226 Difference]: Without dead ends: 4118 [2020-12-01 17:34:13,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2020-12-01 17:34:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3003. [2020-12-01 17:34:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2020-12-01 17:34:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 11299 transitions. [2020-12-01 17:34:13,311 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 11299 transitions. Word has length 21 [2020-12-01 17:34:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:13,311 INFO L481 AbstractCegarLoop]: Abstraction has 3003 states and 11299 transitions. [2020-12-01 17:34:13,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 11299 transitions. [2020-12-01 17:34:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:13,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:13,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:13,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 17:34:13,314 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-01 17:34:13,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:13,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091032063] [2020-12-01 17:34:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:13,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091032063] [2020-12-01 17:34:13,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:13,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 17:34:13,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325685037] [2020-12-01 17:34:13,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 17:34:13,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:13,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 17:34:13,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-01 17:34:13,377 INFO L87 Difference]: Start difference. First operand 3003 states and 11299 transitions. Second operand 7 states. [2020-12-01 17:34:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:13,517 INFO L93 Difference]: Finished difference Result 3452 states and 12730 transitions. [2020-12-01 17:34:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:34:13,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-01 17:34:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:13,529 INFO L225 Difference]: With dead ends: 3452 [2020-12-01 17:34:13,529 INFO L226 Difference]: Without dead ends: 3358 [2020-12-01 17:34:13,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:34:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2020-12-01 17:34:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3004. [2020-12-01 17:34:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-01 17:34:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-01 17:34:13,618 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-01 17:34:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:13,618 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-01 17:34:13,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 17:34:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-01 17:34:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:34:13,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:13,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 17:34:13,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-01 17:34:13,622 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-01 17:34:13,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:13,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537235189] [2020-12-01 17:34:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:13,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537235189] [2020-12-01 17:34:13,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:13,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:13,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055490161] [2020-12-01 17:34:13,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:13,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:13,708 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-01 17:34:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:13,860 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-01 17:34:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 17:34:13,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-01 17:34:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:13,870 INFO L225 Difference]: With dead ends: 3058 [2020-12-01 17:34:13,870 INFO L226 Difference]: Without dead ends: 3058 [2020-12-01 17:34:13,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-01 17:34:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-01 17:34:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-01 17:34:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-01 17:34:13,924 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-01 17:34:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:13,924 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-01 17:34:13,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-01 17:34:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:34:13,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:13,927 INFO L422 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] [2020-12-01 17:34:13,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-01 17:34:13,928 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-01 17:34:13,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:13,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101477998] [2020-12-01 17:34:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:14,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101477998] [2020-12-01 17:34:14,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:14,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:14,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703015750] [2020-12-01 17:34:14,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:14,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:14,021 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-01 17:34:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:14,376 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-01 17:34:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 17:34:14,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-01 17:34:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:14,387 INFO L225 Difference]: With dead ends: 3550 [2020-12-01 17:34:14,388 INFO L226 Difference]: Without dead ends: 3490 [2020-12-01 17:34:14,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:34:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-01 17:34:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-01 17:34:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-01 17:34:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-01 17:34:14,466 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-01 17:34:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:14,466 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-01 17:34:14,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-01 17:34:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:34:14,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:14,469 INFO L422 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] [2020-12-01 17:34:14,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 17:34:14,470 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-01 17:34:14,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:14,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428194718] [2020-12-01 17:34:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:14,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428194718] [2020-12-01 17:34:14,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:14,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:34:14,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909540267] [2020-12-01 17:34:14,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 17:34:14,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 17:34:14,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:34:14,589 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-01 17:34:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:15,005 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-01 17:34:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 17:34:15,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-01 17:34:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:15,016 INFO L225 Difference]: With dead ends: 3862 [2020-12-01 17:34:15,016 INFO L226 Difference]: Without dead ends: 3802 [2020-12-01 17:34:15,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-01 17:34:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-01 17:34:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-01 17:34:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-01 17:34:15,103 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-01 17:34:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:15,103 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-01 17:34:15,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 17:34:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-01 17:34:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:34:15,106 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:15,106 INFO L422 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] [2020-12-01 17:34:15,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-01 17:34:15,107 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-01 17:34:15,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:15,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169433319] [2020-12-01 17:34:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:15,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169433319] [2020-12-01 17:34:15,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:15,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:15,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046396882] [2020-12-01 17:34:15,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:15,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:15,219 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-01 17:34:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:15,569 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-01 17:34:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:15,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-01 17:34:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:15,579 INFO L225 Difference]: With dead ends: 4277 [2020-12-01 17:34:15,579 INFO L226 Difference]: Without dead ends: 4217 [2020-12-01 17:34:15,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-01 17:34:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-01 17:34:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-01 17:34:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-01 17:34:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-01 17:34:15,660 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-01 17:34:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:15,661 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-01 17:34:15,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-01 17:34:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:34:15,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:15,663 INFO L422 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] [2020-12-01 17:34:15,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-01 17:34:15,663 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-01 17:34:15,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:15,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865149270] [2020-12-01 17:34:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:15,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865149270] [2020-12-01 17:34:15,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:15,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:15,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815223112] [2020-12-01 17:34:15,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:15,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:15,775 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-01 17:34:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:16,005 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-01 17:34:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:16,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-01 17:34:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:16,014 INFO L225 Difference]: With dead ends: 3433 [2020-12-01 17:34:16,014 INFO L226 Difference]: Without dead ends: 3373 [2020-12-01 17:34:16,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-01 17:34:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-01 17:34:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-01 17:34:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-01 17:34:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-01 17:34:16,078 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-01 17:34:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:16,078 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-01 17:34:16,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-01 17:34:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:34:16,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:16,081 INFO L422 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] [2020-12-01 17:34:16,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 17:34:16,081 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-01 17:34:16,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:16,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48951656] [2020-12-01 17:34:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:16,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48951656] [2020-12-01 17:34:16,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:16,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:16,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989933479] [2020-12-01 17:34:16,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:16,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:16,312 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-01 17:34:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:16,780 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-01 17:34:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:16,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-01 17:34:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:16,789 INFO L225 Difference]: With dead ends: 3588 [2020-12-01 17:34:16,790 INFO L226 Difference]: Without dead ends: 3528 [2020-12-01 17:34:16,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-01 17:34:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-01 17:34:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-01 17:34:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-01 17:34:16,853 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-01 17:34:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:16,853 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-01 17:34:16,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-01 17:34:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:34:16,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:16,856 INFO L422 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] [2020-12-01 17:34:16,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 17:34:16,856 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-01 17:34:16,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:16,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046977593] [2020-12-01 17:34:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:17,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046977593] [2020-12-01 17:34:17,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:17,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:17,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867744906] [2020-12-01 17:34:17,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:17,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:17,155 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-01 17:34:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:18,029 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-01 17:34:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 17:34:18,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-01 17:34:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:18,036 INFO L225 Difference]: With dead ends: 2896 [2020-12-01 17:34:18,036 INFO L226 Difference]: Without dead ends: 2802 [2020-12-01 17:34:18,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-01 17:34:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-01 17:34:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-01 17:34:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-01 17:34:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-01 17:34:18,115 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-01 17:34:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:18,116 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-01 17:34:18,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-01 17:34:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 17:34:18,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:18,118 INFO L422 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] [2020-12-01 17:34:18,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-01 17:34:18,118 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-01 17:34:18,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:18,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59000461] [2020-12-01 17:34:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:18,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59000461] [2020-12-01 17:34:18,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:18,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:18,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819413479] [2020-12-01 17:34:18,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:18,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:18,420 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-01 17:34:18,789 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-12-01 17:34:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:19,232 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-01 17:34:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 17:34:19,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-01 17:34:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:19,238 INFO L225 Difference]: With dead ends: 2538 [2020-12-01 17:34:19,238 INFO L226 Difference]: Without dead ends: 2419 [2020-12-01 17:34:19,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-01 17:34:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-01 17:34:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-01 17:34:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-01 17:34:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-01 17:34:19,279 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-01 17:34:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:19,279 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-01 17:34:19,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-01 17:34:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:19,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:19,282 INFO L422 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] [2020-12-01 17:34:19,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-01 17:34:19,282 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:19,283 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-01 17:34:19,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:19,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555757608] [2020-12-01 17:34:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:19,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555757608] [2020-12-01 17:34:19,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:19,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 17:34:19,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85413654] [2020-12-01 17:34:19,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 17:34:19,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 17:34:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 17:34:19,328 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-01 17:34:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:19,507 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-01 17:34:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:19,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-01 17:34:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:19,513 INFO L225 Difference]: With dead ends: 2291 [2020-12-01 17:34:19,513 INFO L226 Difference]: Without dead ends: 2227 [2020-12-01 17:34:19,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-01 17:34:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-01 17:34:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-01 17:34:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-01 17:34:19,548 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-01 17:34:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:19,548 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-01 17:34:19,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 17:34:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-01 17:34:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:19,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:19,551 INFO L422 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] [2020-12-01 17:34:19,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-01 17:34:19,552 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-01 17:34:19,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:19,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980292281] [2020-12-01 17:34:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:19,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980292281] [2020-12-01 17:34:19,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:19,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:19,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715099968] [2020-12-01 17:34:19,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:19,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:19,639 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-01 17:34:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:20,025 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-01 17:34:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 17:34:20,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-01 17:34:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:20,031 INFO L225 Difference]: With dead ends: 2599 [2020-12-01 17:34:20,031 INFO L226 Difference]: Without dead ends: 2535 [2020-12-01 17:34:20,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:34:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-01 17:34:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-01 17:34:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-01 17:34:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-01 17:34:20,067 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-01 17:34:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:20,067 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-01 17:34:20,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-01 17:34:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:20,070 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:20,070 INFO L422 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] [2020-12-01 17:34:20,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-01 17:34:20,070 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-01 17:34:20,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:20,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082628277] [2020-12-01 17:34:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:20,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082628277] [2020-12-01 17:34:20,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:20,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:34:20,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462591273] [2020-12-01 17:34:20,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 17:34:20,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 17:34:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-01 17:34:20,184 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-01 17:34:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:20,615 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-01 17:34:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 17:34:20,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-01 17:34:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:20,622 INFO L225 Difference]: With dead ends: 2898 [2020-12-01 17:34:20,623 INFO L226 Difference]: Without dead ends: 2834 [2020-12-01 17:34:20,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-01 17:34:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-01 17:34:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-01 17:34:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-01 17:34:20,679 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-01 17:34:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:20,679 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-01 17:34:20,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 17:34:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-01 17:34:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:20,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:20,683 INFO L422 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] [2020-12-01 17:34:20,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-01 17:34:20,683 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-01 17:34:20,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:20,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740238763] [2020-12-01 17:34:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:20,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740238763] [2020-12-01 17:34:20,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:20,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-01 17:34:20,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202342935] [2020-12-01 17:34:20,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-01 17:34:20,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-01 17:34:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-01 17:34:20,832 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-01 17:34:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:21,407 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-01 17:34:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 17:34:21,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-01 17:34:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:21,415 INFO L225 Difference]: With dead ends: 2875 [2020-12-01 17:34:21,415 INFO L226 Difference]: Without dead ends: 2811 [2020-12-01 17:34:21,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-01 17:34:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-01 17:34:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-01 17:34:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-01 17:34:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-01 17:34:21,481 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-01 17:34:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:21,481 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-01 17:34:21,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-01 17:34:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-01 17:34:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:21,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:21,484 INFO L422 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] [2020-12-01 17:34:21,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-01 17:34:21,484 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-01 17:34:21,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:21,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020859139] [2020-12-01 17:34:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:21,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020859139] [2020-12-01 17:34:21,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:21,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 17:34:21,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378350130] [2020-12-01 17:34:21,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 17:34:21,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:21,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 17:34:21,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:21,631 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-01 17:34:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:22,018 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-01 17:34:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:22,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-01 17:34:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:22,025 INFO L225 Difference]: With dead ends: 3106 [2020-12-01 17:34:22,025 INFO L226 Difference]: Without dead ends: 3042 [2020-12-01 17:34:22,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-01 17:34:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-01 17:34:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-01 17:34:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-01 17:34:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-01 17:34:22,064 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-01 17:34:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:22,064 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-01 17:34:22,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 17:34:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-01 17:34:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:22,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:22,067 INFO L422 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] [2020-12-01 17:34:22,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-01 17:34:22,067 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-01 17:34:22,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:22,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904343546] [2020-12-01 17:34:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:22,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904343546] [2020-12-01 17:34:22,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:22,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-01 17:34:22,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286009249] [2020-12-01 17:34:22,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-01 17:34:22,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-01 17:34:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:22,207 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-01 17:34:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:22,504 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-01 17:34:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:22,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-01 17:34:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:22,512 INFO L225 Difference]: With dead ends: 2481 [2020-12-01 17:34:22,513 INFO L226 Difference]: Without dead ends: 2417 [2020-12-01 17:34:22,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-01 17:34:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-01 17:34:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-01 17:34:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-01 17:34:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-01 17:34:22,571 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-01 17:34:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:22,571 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-01 17:34:22,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-01 17:34:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-01 17:34:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:22,575 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:22,575 INFO L422 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] [2020-12-01 17:34:22,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-01 17:34:22,575 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:22,576 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-01 17:34:22,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:22,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941622620] [2020-12-01 17:34:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:22,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941622620] [2020-12-01 17:34:22,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:22,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-01 17:34:22,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58630129] [2020-12-01 17:34:22,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 17:34:22,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 17:34:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-01 17:34:22,875 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-01 17:34:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:23,794 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-01 17:34:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 17:34:23,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-01 17:34:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:23,802 INFO L225 Difference]: With dead ends: 3018 [2020-12-01 17:34:23,803 INFO L226 Difference]: Without dead ends: 2890 [2020-12-01 17:34:23,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-01 17:34:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-01 17:34:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-01 17:34:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-01 17:34:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-01 17:34:23,859 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-01 17:34:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:23,859 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-01 17:34:23,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 17:34:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-01 17:34:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:34:23,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:23,862 INFO L422 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] [2020-12-01 17:34:23,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-01 17:34:23,863 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-01 17:34:23,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:23,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587852326] [2020-12-01 17:34:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:24,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587852326] [2020-12-01 17:34:24,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:24,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:24,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646801029] [2020-12-01 17:34:24,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:24,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:24,109 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-01 17:34:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:24,568 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-01 17:34:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 17:34:24,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-01 17:34:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:24,583 INFO L225 Difference]: With dead ends: 3157 [2020-12-01 17:34:24,583 INFO L226 Difference]: Without dead ends: 3133 [2020-12-01 17:34:24,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-01 17:34:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-01 17:34:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-01 17:34:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-01 17:34:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-01 17:34:24,647 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-01 17:34:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:24,647 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-01 17:34:24,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-01 17:34:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 17:34:24,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:24,655 INFO L422 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] [2020-12-01 17:34:24,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-01 17:34:24,656 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-01 17:34:24,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:24,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990222187] [2020-12-01 17:34:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:24,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990222187] [2020-12-01 17:34:24,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:24,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:24,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968122490] [2020-12-01 17:34:24,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:24,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:24,932 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-01 17:34:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:25,591 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-01 17:34:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-01 17:34:25,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-01 17:34:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:25,596 INFO L225 Difference]: With dead ends: 2298 [2020-12-01 17:34:25,596 INFO L226 Difference]: Without dead ends: 2254 [2020-12-01 17:34:25,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-01 17:34:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-01 17:34:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-01 17:34:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-01 17:34:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-01 17:34:25,637 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-01 17:34:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:25,637 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-01 17:34:25,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-01 17:34:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 17:34:25,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:25,642 INFO L422 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] [2020-12-01 17:34:25,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-01 17:34:25,642 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-01 17:34:25,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:25,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208926302] [2020-12-01 17:34:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:25,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208926302] [2020-12-01 17:34:25,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:25,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:25,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041785858] [2020-12-01 17:34:25,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:25,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:25,851 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-01 17:34:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:26,328 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-01 17:34:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:26,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-01 17:34:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:26,334 INFO L225 Difference]: With dead ends: 2242 [2020-12-01 17:34:26,334 INFO L226 Difference]: Without dead ends: 2198 [2020-12-01 17:34:26,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-01 17:34:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-01 17:34:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-01 17:34:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-01 17:34:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-01 17:34:26,363 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-01 17:34:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:26,363 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-01 17:34:26,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-01 17:34:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 17:34:26,365 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:26,366 INFO L422 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] [2020-12-01 17:34:26,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-01 17:34:26,366 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-01 17:34:26,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:26,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46285709] [2020-12-01 17:34:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:26,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46285709] [2020-12-01 17:34:26,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:26,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-01 17:34:26,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111418354] [2020-12-01 17:34:26,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-01 17:34:26,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-01 17:34:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:26,591 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-01 17:34:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:27,019 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-01 17:34:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 17:34:27,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-01 17:34:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:27,024 INFO L225 Difference]: With dead ends: 1640 [2020-12-01 17:34:27,024 INFO L226 Difference]: Without dead ends: 1596 [2020-12-01 17:34:27,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-01 17:34:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-01 17:34:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-01 17:34:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-01 17:34:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-01 17:34:27,041 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-01 17:34:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:27,041 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-01 17:34:27,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-01 17:34:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-01 17:34:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:34:27,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:27,044 INFO L422 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] [2020-12-01 17:34:27,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-01 17:34:27,044 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-01 17:34:27,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:27,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374508658] [2020-12-01 17:34:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:27,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374508658] [2020-12-01 17:34:27,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:27,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:34:27,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660552487] [2020-12-01 17:34:27,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:27,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:27,174 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-01 17:34:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:27,399 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-01 17:34:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:27,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-01 17:34:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:27,403 INFO L225 Difference]: With dead ends: 885 [2020-12-01 17:34:27,403 INFO L226 Difference]: Without dead ends: 885 [2020-12-01 17:34:27,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-01 17:34:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-01 17:34:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-01 17:34:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-01 17:34:27,417 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-01 17:34:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:27,418 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-01 17:34:27,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-01 17:34:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:34:27,420 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:27,420 INFO L422 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] [2020-12-01 17:34:27,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-01 17:34:27,420 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-01 17:34:27,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:27,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370049837] [2020-12-01 17:34:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:27,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370049837] [2020-12-01 17:34:27,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:27,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:27,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122175519] [2020-12-01 17:34:27,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 17:34:27,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 17:34:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-01 17:34:27,495 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-01 17:34:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:27,609 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-01 17:34:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:27,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-01 17:34:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:27,612 INFO L225 Difference]: With dead ends: 885 [2020-12-01 17:34:27,612 INFO L226 Difference]: Without dead ends: 741 [2020-12-01 17:34:27,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-01 17:34:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-01 17:34:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-01 17:34:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-01 17:34:27,630 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-01 17:34:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:27,630 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-01 17:34:27,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 17:34:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-01 17:34:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:34:27,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:27,633 INFO L422 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] [2020-12-01 17:34:27,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-01 17:34:27,633 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-01 17:34:27,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:27,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962220669] [2020-12-01 17:34:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:27,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962220669] [2020-12-01 17:34:27,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:27,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-01 17:34:27,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87297188] [2020-12-01 17:34:27,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 17:34:27,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 17:34:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 17:34:27,777 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-01 17:34:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:28,014 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-01 17:34:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:28,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-01 17:34:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:28,017 INFO L225 Difference]: With dead ends: 741 [2020-12-01 17:34:28,017 INFO L226 Difference]: Without dead ends: 741 [2020-12-01 17:34:28,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-01 17:34:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-01 17:34:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-01 17:34:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-01 17:34:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-01 17:34:28,042 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-01 17:34:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:28,042 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-01 17:34:28,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 17:34:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-01 17:34:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:34:28,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:28,047 INFO L422 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] [2020-12-01 17:34:28,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-01 17:34:28,047 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-01 17:34:28,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:28,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689352583] [2020-12-01 17:34:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:34:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:34:28,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689352583] [2020-12-01 17:34:28,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 17:34:28,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 17:34:28,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837396173] [2020-12-01 17:34:28,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 17:34:28,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 17:34:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 17:34:28,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-01 17:34:28,142 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-01 17:34:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 17:34:28,303 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-01 17:34:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 17:34:28,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-01 17:34:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 17:34:28,305 INFO L225 Difference]: With dead ends: 741 [2020-12-01 17:34:28,305 INFO L226 Difference]: Without dead ends: 495 [2020-12-01 17:34:28,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-01 17:34:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-01 17:34:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-01 17:34:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-01 17:34:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-01 17:34:28,324 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-01 17:34:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 17:34:28,325 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-01 17:34:28,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 17:34:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-01 17:34:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:34:28,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 17:34:28,328 INFO L422 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] [2020-12-01 17:34:28,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-01 17:34:28,328 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-01 17:34:28,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:34:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-01 17:34:28,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 17:34:28,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374199052] [2020-12-01 17:34:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 17:34:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:34:28,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:34:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:34:28,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:34:28,491 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 17:34:28,491 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 17:34:28,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-01 17:34:28,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:34:28 BasicIcfg [2020-12-01 17:34:28,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 17:34:28,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:34:28,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:34:28,672 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:34:28,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:48" (3/4) ... [2020-12-01 17:34:28,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:34:28,824 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-01 17:34:28,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:34:28,826 INFO L168 Benchmark]: Toolchain (without parser) took 42130.18 ms. Allocated memory was 48.2 MB in the beginning and 1.3 GB in the end (delta: 1.3 GB). Free memory was 22.4 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,826 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 48.2 MB. Free memory was 30.1 MB in the beginning and 30.1 MB in the end (delta: 34.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:34:28,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 933.14 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.2 MB in the beginning and 24.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.96 ms. Allocated memory is still 58.7 MB. Free memory was 24.4 MB in the beginning and 38.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,827 INFO L168 Benchmark]: Boogie Preprocessor took 30.63 ms. Allocated memory is still 58.7 MB. Free memory was 38.6 MB in the beginning and 37.0 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:34:28,828 INFO L168 Benchmark]: RCFGBuilder took 587.92 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.0 MB in the beginning and 44.3 MB in the end (delta: -7.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,829 INFO L168 Benchmark]: TraceAbstraction took 40317.10 ms. Allocated memory was 71.3 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 43.9 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 75.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,829 INFO L168 Benchmark]: Witness Printer took 155.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-01 17:34:28,832 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.37 ms. Allocated memory is still 48.2 MB. Free memory was 30.1 MB in the beginning and 30.1 MB in the end (delta: 34.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 933.14 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.2 MB in the beginning and 24.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.96 ms. Allocated memory is still 58.7 MB. Free memory was 24.4 MB in the beginning and 38.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.63 ms. Allocated memory is still 58.7 MB. Free memory was 38.6 MB in the beginning and 37.0 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 587.92 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.0 MB in the beginning and 44.3 MB in the end (delta: -7.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40317.10 ms. Allocated memory was 71.3 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 43.9 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 75.3 MB. Max. memory is 16.1 GB. * Witness Printer took 155.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - 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; [L1161] 0 pthread_t t; [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; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6: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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6: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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6: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}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] 1 \read(t4) VAL [\read(t4)=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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] 1 \read(t5) VAL [\read(t5)=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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=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))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 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))={6:0}, v={6:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [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))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 39.7s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 5057 SDtfs, 9980 SDslu, 15246 SDs, 0 SdLazy, 9386 SolverSat, 1375 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 57 SyntacticMatches, 16 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 49 MinimizatonAttempts, 42877 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1042 ConstructedInterpolants, 0 QuantifiedInterpolants, 399096 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...