./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 9a8b2e8d 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.3.100.v20150511-1540.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 03cd0a7f8d429d8aefb1b613ebc0f9aa7662199d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.25-9a8b2e8 [2020-10-20 02:44:33,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:44:33,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:44:33,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:44:33,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:44:33,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:44:33,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:44:33,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:44:33,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:44:33,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:44:33,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:44:33,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:44:33,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:44:33,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:44:33,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:44:33,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:44:33,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:44:33,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:44:33,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:44:33,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:44:33,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:44:33,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:44:33,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:44:33,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:44:33,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:44:33,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:44:33,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:44:33,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:44:33,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:44:33,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:44:33,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:44:33,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:44:33,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:44:33,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:44:33,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:44:33,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:44:33,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:44:33,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:44:33,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:44:33,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:44:33,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:44:33,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 02:44:33,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:44:33,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:44:33,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:44:33,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:44:33,724 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:44:33,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:44:33,725 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:44:33,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:44:33,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:44:33,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:44:33,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:44:33,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:44:33,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:44:33,728 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:44:33,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:44:33,728 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:44:33,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:44:33,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:44:33,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:44:33,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:44:33,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:44:33,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:44:33,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:44:33,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:44:33,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:44:33,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:44:33,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:44:33,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:44:33,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:44:33,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 03cd0a7f8d429d8aefb1b613ebc0f9aa7662199d [2020-10-20 02:44:33,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:44:33,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:44:33,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:44:33,954 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:44:33,954 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:44:33,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-10-20 02:44:34,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a506ab7/f35a5632fe414b74bd3795ad044595db/FLAGa765f7fd5 [2020-10-20 02:44:34,726 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:44:34,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-10-20 02:44:34,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a506ab7/f35a5632fe414b74bd3795ad044595db/FLAGa765f7fd5 [2020-10-20 02:44:35,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a506ab7/f35a5632fe414b74bd3795ad044595db [2020-10-20 02:44:35,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:44:35,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:44:35,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:44:35,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:44:35,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:44:35,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aa102c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35, skipping insertion in model container [2020-10-20 02:44:35,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:44:35,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:44:35,400 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-20 02:44:35,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:44:35,605 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:44:35,624 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-20 02:44:35,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:44:35,899 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:44:35,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35 WrapperNode [2020-10-20 02:44:35,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:44:35,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:44:35,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:44:35,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:44:35,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:44:35,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:44:35,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:44:35,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:44:35,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (1/1) ... [2020-10-20 02:44:35,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:44:35,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:44:35,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:44:35,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:44:36,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (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-10-20 02:44:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:44:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:44:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:44:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:44:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 02:44:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-20 02:44:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-20 02:44:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-20 02:44:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-20 02:44:36,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-20 02:44:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-20 02:44:36,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-20 02:44:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-20 02:44:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:44:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 02:44:36,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:44:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:44:36,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:44:36,078 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 02:44:36,505 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:44:36,505 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 02:44:36,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:44:36 BoogieIcfgContainer [2020-10-20 02:44:36,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:44:36,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:44:36,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:44:36,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:44:36,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:44:35" (1/3) ... [2020-10-20 02:44:36,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a729788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:44:36, skipping insertion in model container [2020-10-20 02:44:36,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:44:35" (2/3) ... [2020-10-20 02:44:36,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a729788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:44:36, skipping insertion in model container [2020-10-20 02:44:36,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:44:36" (3/3) ... [2020-10-20 02:44:36,517 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-20 02:44:36,529 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:44:36,529 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:44:36,538 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 02:44:36,539 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:44:36,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,583 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,583 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,588 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,588 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,588 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,589 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,589 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,589 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,589 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,590 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,590 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,590 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,590 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,591 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,591 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,591 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,591 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,591 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,592 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,592 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,592 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,592 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,593 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,593 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,593 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,593 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,594 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,594 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,594 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,594 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,594 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,595 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,595 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,595 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,595 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,595 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,596 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,596 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,596 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,596 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,597 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,597 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,597 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,597 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,597 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,598 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,598 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,598 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,599 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,600 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,600 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,600 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,600 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,601 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,601 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,603 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,603 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,603 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,603 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,604 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,604 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,604 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,604 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,604 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,605 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,605 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,606 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,613 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,613 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,614 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,614 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,629 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,629 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,629 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,629 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,644 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,644 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,645 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,645 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,659 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,659 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,660 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,660 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,660 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,660 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,666 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,666 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,666 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,666 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,667 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,667 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,667 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,667 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,667 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,668 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,668 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,670 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,670 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,670 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,670 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,670 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,671 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,671 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,671 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,671 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,671 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,672 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,672 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,673 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,678 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,678 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,678 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,679 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,687 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,688 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,688 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,688 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,688 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,688 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,696 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,696 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,696 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,696 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,700 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,700 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,700 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,700 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,704 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,705 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,707 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,707 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,709 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,709 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,709 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,710 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:44:36,825 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-10-20 02:44:36,840 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-20 02:44:36,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:44:36,863 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:44:36,864 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:44:36,864 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:44:36,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:44:36,864 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:44:36,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:44:36,864 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:44:36,903 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:44:36,906 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 252 transitions, 884 flow [2020-10-20 02:44:36,911 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 252 transitions, 884 flow [2020-10-20 02:44:36,913 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 180 places, 252 transitions, 884 flow [2020-10-20 02:44:37,071 INFO L129 PetriNetUnfolder]: 67/298 cut-off events. [2020-10-20 02:44:37,072 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-20 02:44:37,086 INFO L80 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 298 events. 67/298 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 915 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 387. Up to 24 conditions per place. [2020-10-20 02:44:37,100 INFO L117 LiptonReduction]: Number of co-enabled transitions 4628 [2020-10-20 02:44:39,085 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-20 02:44:39,193 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-20 02:44:39,502 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-10-20 02:44:39,717 INFO L132 LiptonReduction]: Checked pairs total: 52821 [2020-10-20 02:44:39,718 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-20 02:44:39,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-20 02:44:40,769 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-20 02:44:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-20 02:44:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:44:40,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:40,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:40,780 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1423321664, now seen corresponding path program 1 times [2020-10-20 02:44:40,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:40,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030514959] [2020-10-20 02:44:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:41,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030514959] [2020-10-20 02:44:41,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:41,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:44:41,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282116955] [2020-10-20 02:44:41,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:44:41,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:44:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:44:41,172 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 5 states. [2020-10-20 02:44:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:41,676 INFO L93 Difference]: Finished difference Result 4761 states and 19901 transitions. [2020-10-20 02:44:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:41,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-20 02:44:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:41,739 INFO L225 Difference]: With dead ends: 4761 [2020-10-20 02:44:41,740 INFO L226 Difference]: Without dead ends: 4273 [2020-10-20 02:44:41,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2020-10-20 02:44:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3019. [2020-10-20 02:44:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2020-10-20 02:44:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 12273 transitions. [2020-10-20 02:44:42,031 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 12273 transitions. Word has length 9 [2020-10-20 02:44:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:42,031 INFO L481 AbstractCegarLoop]: Abstraction has 3019 states and 12273 transitions. [2020-10-20 02:44:42,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:44:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 12273 transitions. [2020-10-20 02:44:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:44:42,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:42,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:42,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:44:42,034 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1027712446, now seen corresponding path program 2 times [2020-10-20 02:44:42,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:42,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933980430] [2020-10-20 02:44:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:42,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933980430] [2020-10-20 02:44:42,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:42,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:42,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625381458] [2020-10-20 02:44:42,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:42,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:42,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:42,162 INFO L87 Difference]: Start difference. First operand 3019 states and 12273 transitions. Second operand 6 states. [2020-10-20 02:44:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:42,676 INFO L93 Difference]: Finished difference Result 4277 states and 18060 transitions. [2020-10-20 02:44:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:42,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 02:44:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:42,737 INFO L225 Difference]: With dead ends: 4277 [2020-10-20 02:44:42,737 INFO L226 Difference]: Without dead ends: 4277 [2020-10-20 02:44:42,738 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-10-20 02:44:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2020-10-20 02:44:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 3019. [2020-10-20 02:44:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2020-10-20 02:44:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 12273 transitions. [2020-10-20 02:44:42,955 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 12273 transitions. Word has length 9 [2020-10-20 02:44:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:42,955 INFO L481 AbstractCegarLoop]: Abstraction has 3019 states and 12273 transitions. [2020-10-20 02:44:42,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 12273 transitions. [2020-10-20 02:44:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:44:42,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:42,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:42,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:44:42,960 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash 556122090, now seen corresponding path program 3 times [2020-10-20 02:44:42,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:42,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237271024] [2020-10-20 02:44:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:43,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237271024] [2020-10-20 02:44:43,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:43,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:43,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278932477] [2020-10-20 02:44:43,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:43,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:43,122 INFO L87 Difference]: Start difference. First operand 3019 states and 12273 transitions. Second operand 6 states. [2020-10-20 02:44:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:43,443 INFO L93 Difference]: Finished difference Result 5523 states and 23828 transitions. [2020-10-20 02:44:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:43,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 02:44:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:43,557 INFO L225 Difference]: With dead ends: 5523 [2020-10-20 02:44:43,558 INFO L226 Difference]: Without dead ends: 5523 [2020-10-20 02:44:43,558 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-10-20 02:44:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2020-10-20 02:44:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 3008. [2020-10-20 02:44:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-20 02:44:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-20 02:44:43,714 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-20 02:44:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:43,715 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-20 02:44:43,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-20 02:44:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:44:43,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:43,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:43,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:44:43,719 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1988086522, now seen corresponding path program 1 times [2020-10-20 02:44:43,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:43,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550931819] [2020-10-20 02:44:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:43,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550931819] [2020-10-20 02:44:43,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:43,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:44:43,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110931162] [2020-10-20 02:44:43,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:44:43,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:44:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:44:43,911 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 5 states. [2020-10-20 02:44:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:44,060 INFO L93 Difference]: Finished difference Result 4187 states and 17338 transitions. [2020-10-20 02:44:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:44,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-20 02:44:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:44,079 INFO L225 Difference]: With dead ends: 4187 [2020-10-20 02:44:44,080 INFO L226 Difference]: Without dead ends: 4187 [2020-10-20 02:44:44,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2020-10-20 02:44:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 3589. [2020-10-20 02:44:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2020-10-20 02:44:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 15016 transitions. [2020-10-20 02:44:44,264 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 15016 transitions. Word has length 16 [2020-10-20 02:44:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:44,265 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 15016 transitions. [2020-10-20 02:44:44,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:44:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 15016 transitions. [2020-10-20 02:44:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:44:44,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:44,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:44,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:44:44,268 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 776672030, now seen corresponding path program 2 times [2020-10-20 02:44:44,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:44,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936479555] [2020-10-20 02:44:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:44,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936479555] [2020-10-20 02:44:44,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:44,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:44:44,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483931938] [2020-10-20 02:44:44,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:44:44,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:44:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:44:44,308 INFO L87 Difference]: Start difference. First operand 3589 states and 15016 transitions. Second operand 3 states. [2020-10-20 02:44:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:44,450 INFO L93 Difference]: Finished difference Result 5757 states and 23648 transitions. [2020-10-20 02:44:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:44:44,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-20 02:44:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:44,472 INFO L225 Difference]: With dead ends: 5757 [2020-10-20 02:44:44,472 INFO L226 Difference]: Without dead ends: 4163 [2020-10-20 02:44:44,473 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-10-20 02:44:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2020-10-20 02:44:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 3595. [2020-10-20 02:44:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2020-10-20 02:44:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 14094 transitions. [2020-10-20 02:44:44,606 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 14094 transitions. Word has length 16 [2020-10-20 02:44:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:44,607 INFO L481 AbstractCegarLoop]: Abstraction has 3595 states and 14094 transitions. [2020-10-20 02:44:44,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:44:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 14094 transitions. [2020-10-20 02:44:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:44:44,615 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:44,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:44,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:44:44,616 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1692971290, now seen corresponding path program 1 times [2020-10-20 02:44:44,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:44,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765868586] [2020-10-20 02:44:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:44,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765868586] [2020-10-20 02:44:44,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:44,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:44,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638268918] [2020-10-20 02:44:44,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:44,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:44,777 INFO L87 Difference]: Start difference. First operand 3595 states and 14094 transitions. Second operand 6 states. [2020-10-20 02:44:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:44,988 INFO L93 Difference]: Finished difference Result 4831 states and 19135 transitions. [2020-10-20 02:44:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:44,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 02:44:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:45,012 INFO L225 Difference]: With dead ends: 4831 [2020-10-20 02:44:45,012 INFO L226 Difference]: Without dead ends: 4807 [2020-10-20 02:44:45,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2020-10-20 02:44:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3588. [2020-10-20 02:44:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-20 02:44:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-20 02:44:45,218 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-20 02:44:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:45,219 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-20 02:44:45,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-20 02:44:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:44:45,222 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:45,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:45,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:44:45,223 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1511808800, now seen corresponding path program 2 times [2020-10-20 02:44:45,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:45,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229003794] [2020-10-20 02:44:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:45,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229003794] [2020-10-20 02:44:45,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:45,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:45,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658557197] [2020-10-20 02:44:45,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:45,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:45,336 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-20 02:44:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:45,470 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-20 02:44:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:45,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 02:44:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:45,714 INFO L225 Difference]: With dead ends: 4024 [2020-10-20 02:44:45,714 INFO L226 Difference]: Without dead ends: 4024 [2020-10-20 02:44:45,715 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-10-20 02:44:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-20 02:44:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-20 02:44:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-20 02:44:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-20 02:44:45,834 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-20 02:44:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:45,834 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-20 02:44:45,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-20 02:44:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:44:45,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:45,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:45,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:44:45,836 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1715651031, now seen corresponding path program 1 times [2020-10-20 02:44:45,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:45,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070516978] [2020-10-20 02:44:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:45,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070516978] [2020-10-20 02:44:45,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:45,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:44:45,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208575500] [2020-10-20 02:44:45,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:44:45,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:44:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:44:45,878 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 5 states. [2020-10-20 02:44:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:46,083 INFO L93 Difference]: Finished difference Result 4639 states and 18148 transitions. [2020-10-20 02:44:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:46,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-20 02:44:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:46,105 INFO L225 Difference]: With dead ends: 4639 [2020-10-20 02:44:46,105 INFO L226 Difference]: Without dead ends: 4543 [2020-10-20 02:44:46,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2020-10-20 02:44:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4103. [2020-10-20 02:44:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2020-10-20 02:44:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 16284 transitions. [2020-10-20 02:44:46,240 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 16284 transitions. Word has length 18 [2020-10-20 02:44:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:46,240 INFO L481 AbstractCegarLoop]: Abstraction has 4103 states and 16284 transitions. [2020-10-20 02:44:46,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:44:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 16284 transitions. [2020-10-20 02:44:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:44:46,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:46,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:46,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:44:46,243 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:46,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1948840627, now seen corresponding path program 2 times [2020-10-20 02:44:46,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:46,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108296139] [2020-10-20 02:44:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:46,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108296139] [2020-10-20 02:44:46,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:46,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:46,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276723348] [2020-10-20 02:44:46,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:46,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:46,337 INFO L87 Difference]: Start difference. First operand 4103 states and 16284 transitions. Second operand 6 states. [2020-10-20 02:44:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:46,496 INFO L93 Difference]: Finished difference Result 4755 states and 18464 transitions. [2020-10-20 02:44:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:46,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 02:44:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:46,512 INFO L225 Difference]: With dead ends: 4755 [2020-10-20 02:44:46,512 INFO L226 Difference]: Without dead ends: 4659 [2020-10-20 02:44:46,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2020-10-20 02:44:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3713. [2020-10-20 02:44:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-20 02:44:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-20 02:44:46,686 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-20 02:44:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:46,690 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-20 02:44:46,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-20 02:44:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:44:46,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:46,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:46,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:44:46,693 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash -620579829, now seen corresponding path program 3 times [2020-10-20 02:44:46,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:46,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909571856] [2020-10-20 02:44:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:46,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909571856] [2020-10-20 02:44:46,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:46,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:44:46,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195089553] [2020-10-20 02:44:46,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:44:46,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:44:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:46,834 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-10-20 02:44:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:47,140 INFO L93 Difference]: Finished difference Result 4973 states and 19765 transitions. [2020-10-20 02:44:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:47,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-20 02:44:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:47,238 INFO L225 Difference]: With dead ends: 4973 [2020-10-20 02:44:47,238 INFO L226 Difference]: Without dead ends: 4899 [2020-10-20 02:44:47,238 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-10-20 02:44:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2020-10-20 02:44:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4127. [2020-10-20 02:44:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4127 states. [2020-10-20 02:44:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 16610 transitions. [2020-10-20 02:44:47,362 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 16610 transitions. Word has length 18 [2020-10-20 02:44:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:47,367 INFO L481 AbstractCegarLoop]: Abstraction has 4127 states and 16610 transitions. [2020-10-20 02:44:47,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:44:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 16610 transitions. [2020-10-20 02:44:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:44:47,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:47,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:47,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 02:44:47,372 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash -570830033, now seen corresponding path program 4 times [2020-10-20 02:44:47,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:47,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490093971] [2020-10-20 02:44:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:47,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490093971] [2020-10-20 02:44:47,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:47,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:44:47,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661144395] [2020-10-20 02:44:47,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:44:47,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:47,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:44:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:44:47,512 INFO L87 Difference]: Start difference. First operand 4127 states and 16610 transitions. Second operand 10 states. [2020-10-20 02:44:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:47,947 INFO L93 Difference]: Finished difference Result 5275 states and 21270 transitions. [2020-10-20 02:44:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:47,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-20 02:44:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:47,965 INFO L225 Difference]: With dead ends: 5275 [2020-10-20 02:44:47,965 INFO L226 Difference]: Without dead ends: 5219 [2020-10-20 02:44:47,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-20 02:44:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2020-10-20 02:44:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4127. [2020-10-20 02:44:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4127 states. [2020-10-20 02:44:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 16610 transitions. [2020-10-20 02:44:48,345 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 16610 transitions. Word has length 18 [2020-10-20 02:44:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:48,346 INFO L481 AbstractCegarLoop]: Abstraction has 4127 states and 16610 transitions. [2020-10-20 02:44:48,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:44:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 16610 transitions. [2020-10-20 02:44:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 02:44:48,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:48,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:44:48,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 02:44:48,348 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1495509801, now seen corresponding path program 5 times [2020-10-20 02:44:48,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:48,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479715516] [2020-10-20 02:44:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:48,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479715516] [2020-10-20 02:44:48,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:48,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:44:48,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497726678] [2020-10-20 02:44:48,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:44:48,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:44:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:48,431 INFO L87 Difference]: Start difference. First operand 4127 states and 16610 transitions. Second operand 8 states. [2020-10-20 02:44:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:48,753 INFO L93 Difference]: Finished difference Result 6468 states and 26392 transitions. [2020-10-20 02:44:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:44:48,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-20 02:44:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:48,822 INFO L225 Difference]: With dead ends: 6468 [2020-10-20 02:44:48,822 INFO L226 Difference]: Without dead ends: 6394 [2020-10-20 02:44:48,822 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-10-20 02:44:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2020-10-20 02:44:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 4114. [2020-10-20 02:44:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2020-10-20 02:44:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2020-10-20 02:44:48,963 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2020-10-20 02:44:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:48,964 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2020-10-20 02:44:48,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:44:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2020-10-20 02:44:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:44:48,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:48,966 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-10-20 02:44:48,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 02:44:48,967 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2124042944, now seen corresponding path program 1 times [2020-10-20 02:44:48,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:48,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150228255] [2020-10-20 02:44:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:49,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150228255] [2020-10-20 02:44:49,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:49,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:49,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123141389] [2020-10-20 02:44:49,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:49,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:49,015 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 6 states. [2020-10-20 02:44:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:49,140 INFO L93 Difference]: Finished difference Result 4685 states and 18319 transitions. [2020-10-20 02:44:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:49,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-20 02:44:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:49,152 INFO L225 Difference]: With dead ends: 4685 [2020-10-20 02:44:49,152 INFO L226 Difference]: Without dead ends: 4685 [2020-10-20 02:44:49,152 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-10-20 02:44:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-10-20 02:44:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 4129. [2020-10-20 02:44:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-20 02:44:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16615 transitions. [2020-10-20 02:44:49,508 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16615 transitions. Word has length 19 [2020-10-20 02:44:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:49,509 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16615 transitions. [2020-10-20 02:44:49,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16615 transitions. [2020-10-20 02:44:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:44:49,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:49,513 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-10-20 02:44:49,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 02:44:49,514 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1995336633, now seen corresponding path program 1 times [2020-10-20 02:44:49,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:49,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742516078] [2020-10-20 02:44:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:49,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742516078] [2020-10-20 02:44:49,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:49,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 02:44:49,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601883479] [2020-10-20 02:44:49,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 02:44:49,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 02:44:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 02:44:49,672 INFO L87 Difference]: Start difference. First operand 4129 states and 16615 transitions. Second operand 9 states. [2020-10-20 02:44:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:50,112 INFO L93 Difference]: Finished difference Result 5929 states and 24603 transitions. [2020-10-20 02:44:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:50,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-20 02:44:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:50,132 INFO L225 Difference]: With dead ends: 5929 [2020-10-20 02:44:50,132 INFO L226 Difference]: Without dead ends: 5855 [2020-10-20 02:44:50,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2020-10-20 02:44:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4117. [2020-10-20 02:44:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2020-10-20 02:44:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 16571 transitions. [2020-10-20 02:44:50,272 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 16571 transitions. Word has length 19 [2020-10-20 02:44:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:50,273 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 16571 transitions. [2020-10-20 02:44:50,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 02:44:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 16571 transitions. [2020-10-20 02:44:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:44:50,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:50,276 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-10-20 02:44:50,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 02:44:50,276 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1945586837, now seen corresponding path program 2 times [2020-10-20 02:44:50,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:50,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288346745] [2020-10-20 02:44:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:50,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288346745] [2020-10-20 02:44:50,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:50,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 02:44:50,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836767739] [2020-10-20 02:44:50,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 02:44:50,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 02:44:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:44:50,426 INFO L87 Difference]: Start difference. First operand 4117 states and 16571 transitions. Second operand 11 states. [2020-10-20 02:44:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:50,955 INFO L93 Difference]: Finished difference Result 5748 states and 23783 transitions. [2020-10-20 02:44:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:44:50,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-10-20 02:44:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:50,973 INFO L225 Difference]: With dead ends: 5748 [2020-10-20 02:44:50,973 INFO L226 Difference]: Without dead ends: 5686 [2020-10-20 02:44:50,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:44:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2020-10-20 02:44:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 4066. [2020-10-20 02:44:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-10-20 02:44:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16383 transitions. [2020-10-20 02:44:51,175 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16383 transitions. Word has length 19 [2020-10-20 02:44:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:51,175 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16383 transitions. [2020-10-20 02:44:51,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 02:44:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16383 transitions. [2020-10-20 02:44:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:44:51,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:51,179 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-10-20 02:44:51,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 02:44:51,179 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:51,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1149139064, now seen corresponding path program 2 times [2020-10-20 02:44:51,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:51,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341889111] [2020-10-20 02:44:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:51,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341889111] [2020-10-20 02:44:51,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:51,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:44:51,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682670145] [2020-10-20 02:44:51,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:44:51,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:44:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:51,256 INFO L87 Difference]: Start difference. First operand 4066 states and 16383 transitions. Second operand 7 states. [2020-10-20 02:44:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:51,386 INFO L93 Difference]: Finished difference Result 4549 states and 17853 transitions. [2020-10-20 02:44:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:51,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-20 02:44:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:51,400 INFO L225 Difference]: With dead ends: 4549 [2020-10-20 02:44:51,401 INFO L226 Difference]: Without dead ends: 4549 [2020-10-20 02:44:51,401 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-10-20 02:44:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2020-10-20 02:44:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4013. [2020-10-20 02:44:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-10-20 02:44:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-10-20 02:44:51,531 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-10-20 02:44:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:51,531 INFO L481 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-10-20 02:44:51,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:44:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-10-20 02:44:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:44:51,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:51,535 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-10-20 02:44:51,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 02:44:51,535 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1420640526, now seen corresponding path program 1 times [2020-10-20 02:44:51,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:51,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547955343] [2020-10-20 02:44:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:51,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547955343] [2020-10-20 02:44:51,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:51,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:44:51,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834799126] [2020-10-20 02:44:51,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:44:51,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:44:51,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:51,945 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 8 states. [2020-10-20 02:44:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:52,179 INFO L93 Difference]: Finished difference Result 5053 states and 20226 transitions. [2020-10-20 02:44:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:52,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-20 02:44:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:52,194 INFO L225 Difference]: With dead ends: 5053 [2020-10-20 02:44:52,195 INFO L226 Difference]: Without dead ends: 5007 [2020-10-20 02:44:52,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:44:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2020-10-20 02:44:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4013. [2020-10-20 02:44:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-10-20 02:44:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-10-20 02:44:52,289 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 20 [2020-10-20 02:44:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:52,289 INFO L481 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-10-20 02:44:52,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:44:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-10-20 02:44:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:44:52,292 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:52,292 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-10-20 02:44:52,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 02:44:52,292 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash 282076670, now seen corresponding path program 2 times [2020-10-20 02:44:52,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:52,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96892063] [2020-10-20 02:44:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:52,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96892063] [2020-10-20 02:44:52,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:52,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:44:52,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388306547] [2020-10-20 02:44:52,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:44:52,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:44:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:44:52,449 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 10 states. [2020-10-20 02:44:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:52,804 INFO L93 Difference]: Finished difference Result 5549 states and 22340 transitions. [2020-10-20 02:44:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:44:52,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-20 02:44:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:52,820 INFO L225 Difference]: With dead ends: 5549 [2020-10-20 02:44:52,820 INFO L226 Difference]: Without dead ends: 5503 [2020-10-20 02:44:52,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-20 02:44:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5503 states. [2020-10-20 02:44:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5503 to 4149. [2020-10-20 02:44:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2020-10-20 02:44:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 16837 transitions. [2020-10-20 02:44:52,937 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 16837 transitions. Word has length 20 [2020-10-20 02:44:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:52,938 INFO L481 AbstractCegarLoop]: Abstraction has 4149 states and 16837 transitions. [2020-10-20 02:44:52,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:44:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 16837 transitions. [2020-10-20 02:44:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:44:52,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:52,941 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-10-20 02:44:52,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 02:44:52,941 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1943164257, now seen corresponding path program 1 times [2020-10-20 02:44:52,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:52,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145951737] [2020-10-20 02:44:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:53,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145951737] [2020-10-20 02:44:53,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:53,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:44:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397208305] [2020-10-20 02:44:53,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:44:53,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:44:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:44:53,130 INFO L87 Difference]: Start difference. First operand 4149 states and 16837 transitions. Second operand 10 states. [2020-10-20 02:44:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:53,531 INFO L93 Difference]: Finished difference Result 6400 states and 26033 transitions. [2020-10-20 02:44:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:44:53,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-20 02:44:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:53,547 INFO L225 Difference]: With dead ends: 6400 [2020-10-20 02:44:53,547 INFO L226 Difference]: Without dead ends: 6354 [2020-10-20 02:44:53,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-10-20 02:44:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2020-10-20 02:44:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 3978. [2020-10-20 02:44:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-10-20 02:44:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-10-20 02:44:53,894 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2020-10-20 02:44:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:53,894 INFO L481 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-10-20 02:44:53,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:44:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-10-20 02:44:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:44:53,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:53,897 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-10-20 02:44:53,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 02:44:53,897 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1568244378, now seen corresponding path program 3 times [2020-10-20 02:44:53,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:53,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072383552] [2020-10-20 02:44:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:53,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072383552] [2020-10-20 02:44:53,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:53,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:44:53,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280212439] [2020-10-20 02:44:53,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:44:53,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:44:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:53,950 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 7 states. [2020-10-20 02:44:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:54,164 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2020-10-20 02:44:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:44:54,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-20 02:44:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:54,181 INFO L225 Difference]: With dead ends: 6325 [2020-10-20 02:44:54,181 INFO L226 Difference]: Without dead ends: 6279 [2020-10-20 02:44:54,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2020-10-20 02:44:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2020-10-20 02:44:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-10-20 02:44:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-10-20 02:44:54,263 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-10-20 02:44:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:54,263 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-10-20 02:44:54,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:44:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-10-20 02:44:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:54,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:54,266 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-10-20 02:44:54,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 02:44:54,266 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1192691367, now seen corresponding path program 1 times [2020-10-20 02:44:54,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:54,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610973191] [2020-10-20 02:44:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:54,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610973191] [2020-10-20 02:44:54,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:54,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:44:54,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875097543] [2020-10-20 02:44:54,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:44:54,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:54,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:44:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:44:54,387 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 5 states. [2020-10-20 02:44:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:54,517 INFO L93 Difference]: Finished difference Result 4734 states and 18681 transitions. [2020-10-20 02:44:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:54,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-20 02:44:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:54,528 INFO L225 Difference]: With dead ends: 4734 [2020-10-20 02:44:54,528 INFO L226 Difference]: Without dead ends: 4659 [2020-10-20 02:44:54,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2020-10-20 02:44:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4277. [2020-10-20 02:44:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4277 states. [2020-10-20 02:44:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 17201 transitions. [2020-10-20 02:44:54,600 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 17201 transitions. Word has length 21 [2020-10-20 02:44:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:54,600 INFO L481 AbstractCegarLoop]: Abstraction has 4277 states and 17201 transitions. [2020-10-20 02:44:54,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:44:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 17201 transitions. [2020-10-20 02:44:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:54,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:54,604 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-10-20 02:44:54,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 02:44:54,604 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -796445437, now seen corresponding path program 2 times [2020-10-20 02:44:54,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:54,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814671759] [2020-10-20 02:44:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:54,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814671759] [2020-10-20 02:44:54,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:54,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:54,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353421359] [2020-10-20 02:44:54,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:54,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:54,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:54,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:54,671 INFO L87 Difference]: Start difference. First operand 4277 states and 17201 transitions. Second operand 6 states. [2020-10-20 02:44:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:54,844 INFO L93 Difference]: Finished difference Result 5056 states and 19868 transitions. [2020-10-20 02:44:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:44:54,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-20 02:44:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:54,857 INFO L225 Difference]: With dead ends: 5056 [2020-10-20 02:44:54,857 INFO L226 Difference]: Without dead ends: 4981 [2020-10-20 02:44:54,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4981 states. [2020-10-20 02:44:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4981 to 4270. [2020-10-20 02:44:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-10-20 02:44:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-10-20 02:44:54,991 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-10-20 02:44:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:54,991 INFO L481 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-10-20 02:44:54,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-10-20 02:44:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:54,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:54,993 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-10-20 02:44:54,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 02:44:54,994 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash -112710267, now seen corresponding path program 3 times [2020-10-20 02:44:54,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:54,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979338571] [2020-10-20 02:44:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:55,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979338571] [2020-10-20 02:44:55,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:55,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:44:55,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349236429] [2020-10-20 02:44:55,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:44:55,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:55,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:44:55,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:44:55,043 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 6 states. [2020-10-20 02:44:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:55,154 INFO L93 Difference]: Finished difference Result 5197 states and 20300 transitions. [2020-10-20 02:44:55,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:55,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-20 02:44:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:55,166 INFO L225 Difference]: With dead ends: 5197 [2020-10-20 02:44:55,166 INFO L226 Difference]: Without dead ends: 4674 [2020-10-20 02:44:55,167 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-10-20 02:44:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2020-10-20 02:44:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 3901. [2020-10-20 02:44:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-10-20 02:44:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 15421 transitions. [2020-10-20 02:44:55,235 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 15421 transitions. Word has length 21 [2020-10-20 02:44:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:55,236 INFO L481 AbstractCegarLoop]: Abstraction has 3901 states and 15421 transitions. [2020-10-20 02:44:55,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:44:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 15421 transitions. [2020-10-20 02:44:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:55,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:55,238 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-10-20 02:44:55,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 02:44:55,238 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1192651111, now seen corresponding path program 1 times [2020-10-20 02:44:55,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:55,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220789361] [2020-10-20 02:44:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:55,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220789361] [2020-10-20 02:44:55,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:55,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:44:55,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823276573] [2020-10-20 02:44:55,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:44:55,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:55,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:44:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:44:55,368 INFO L87 Difference]: Start difference. First operand 3901 states and 15421 transitions. Second operand 7 states. [2020-10-20 02:44:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:55,503 INFO L93 Difference]: Finished difference Result 4542 states and 17587 transitions. [2020-10-20 02:44:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:55,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-20 02:44:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:55,516 INFO L225 Difference]: With dead ends: 4542 [2020-10-20 02:44:55,516 INFO L226 Difference]: Without dead ends: 4387 [2020-10-20 02:44:55,516 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-10-20 02:44:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2020-10-20 02:44:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 3891. [2020-10-20 02:44:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3891 states. [2020-10-20 02:44:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 15399 transitions. [2020-10-20 02:44:55,589 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 15399 transitions. Word has length 21 [2020-10-20 02:44:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:55,589 INFO L481 AbstractCegarLoop]: Abstraction has 3891 states and 15399 transitions. [2020-10-20 02:44:55,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:44:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 15399 transitions. [2020-10-20 02:44:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:55,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:55,592 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-10-20 02:44:55,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 02:44:55,592 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1805729590, now seen corresponding path program 1 times [2020-10-20 02:44:55,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:55,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240034551] [2020-10-20 02:44:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:55,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240034551] [2020-10-20 02:44:55,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:55,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 02:44:55,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134502661] [2020-10-20 02:44:55,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 02:44:55,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 02:44:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:44:55,746 INFO L87 Difference]: Start difference. First operand 3891 states and 15399 transitions. Second operand 11 states. [2020-10-20 02:44:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:56,269 INFO L93 Difference]: Finished difference Result 4755 states and 18401 transitions. [2020-10-20 02:44:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:44:56,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-20 02:44:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:56,281 INFO L225 Difference]: With dead ends: 4755 [2020-10-20 02:44:56,281 INFO L226 Difference]: Without dead ends: 4706 [2020-10-20 02:44:56,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:44:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2020-10-20 02:44:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3503. [2020-10-20 02:44:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2020-10-20 02:44:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 13480 transitions. [2020-10-20 02:44:56,344 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 13480 transitions. Word has length 21 [2020-10-20 02:44:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:56,344 INFO L481 AbstractCegarLoop]: Abstraction has 3503 states and 13480 transitions. [2020-10-20 02:44:56,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 02:44:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 13480 transitions. [2020-10-20 02:44:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:56,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:56,346 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-10-20 02:44:56,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 02:44:56,346 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -895791388, now seen corresponding path program 1 times [2020-10-20 02:44:56,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:56,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702397250] [2020-10-20 02:44:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:56,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702397250] [2020-10-20 02:44:56,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:56,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:44:56,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351411654] [2020-10-20 02:44:56,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:44:56,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:44:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:44:56,493 INFO L87 Difference]: Start difference. First operand 3503 states and 13480 transitions. Second operand 10 states. [2020-10-20 02:44:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:56,799 INFO L93 Difference]: Finished difference Result 4973 states and 19560 transitions. [2020-10-20 02:44:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:56,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-20 02:44:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:56,813 INFO L225 Difference]: With dead ends: 4973 [2020-10-20 02:44:56,813 INFO L226 Difference]: Without dead ends: 4899 [2020-10-20 02:44:56,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-20 02:44:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2020-10-20 02:44:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3757. [2020-10-20 02:44:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2020-10-20 02:44:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 14845 transitions. [2020-10-20 02:44:56,959 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 14845 transitions. Word has length 21 [2020-10-20 02:44:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:56,959 INFO L481 AbstractCegarLoop]: Abstraction has 3757 states and 14845 transitions. [2020-10-20 02:44:56,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:44:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 14845 transitions. [2020-10-20 02:44:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:56,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:56,962 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-10-20 02:44:56,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 02:44:56,962 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:56,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:56,962 INFO L82 PathProgramCache]: Analyzing trace with hash -846041592, now seen corresponding path program 2 times [2020-10-20 02:44:56,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:56,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471421021] [2020-10-20 02:44:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:57,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471421021] [2020-10-20 02:44:57,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:57,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 02:44:57,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865350108] [2020-10-20 02:44:57,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 02:44:57,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 02:44:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:57,125 INFO L87 Difference]: Start difference. First operand 3757 states and 14845 transitions. Second operand 12 states. [2020-10-20 02:44:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:57,437 INFO L93 Difference]: Finished difference Result 4418 states and 17155 transitions. [2020-10-20 02:44:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:44:57,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-20 02:44:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:57,448 INFO L225 Difference]: With dead ends: 4418 [2020-10-20 02:44:57,448 INFO L226 Difference]: Without dead ends: 4262 [2020-10-20 02:44:57,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-10-20 02:44:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-10-20 02:44:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3004. [2020-10-20 02:44:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-10-20 02:44:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-10-20 02:44:57,579 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-10-20 02:44:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:57,579 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-10-20 02:44:57,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 02:44:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-10-20 02:44:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 02:44:57,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:57,581 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-10-20 02:44:57,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 02:44:57,582 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 73563545, now seen corresponding path program 2 times [2020-10-20 02:44:57,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:57,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782432821] [2020-10-20 02:44:57,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:57,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782432821] [2020-10-20 02:44:57,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:57,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:44:57,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511888297] [2020-10-20 02:44:57,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:44:57,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:44:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:57,664 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-10-20 02:44:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:57,788 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-10-20 02:44:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:44:57,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-20 02:44:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:57,796 INFO L225 Difference]: With dead ends: 3058 [2020-10-20 02:44:57,796 INFO L226 Difference]: Without dead ends: 3058 [2020-10-20 02:44:57,797 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-10-20 02:44:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-10-20 02:44:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-10-20 02:44:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-10-20 02:44:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-10-20 02:44:57,845 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-10-20 02:44:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:57,845 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-10-20 02:44:57,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:44:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-10-20 02:44:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:44:57,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:57,847 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-10-20 02:44:57,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 02:44:57,848 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash 800776370, now seen corresponding path program 1 times [2020-10-20 02:44:57,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:57,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224875292] [2020-10-20 02:44:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:57,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224875292] [2020-10-20 02:44:57,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:57,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:44:57,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624638197] [2020-10-20 02:44:57,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:44:57,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:44:57,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:44:57,928 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-10-20 02:44:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:58,134 INFO L93 Difference]: Finished difference Result 3544 states and 13071 transitions. [2020-10-20 02:44:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:44:58,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 02:44:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:58,146 INFO L225 Difference]: With dead ends: 3544 [2020-10-20 02:44:58,147 INFO L226 Difference]: Without dead ends: 3484 [2020-10-20 02:44:58,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2020-10-20 02:44:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 2822. [2020-10-20 02:44:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-20 02:44:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-10-20 02:44:58,225 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-10-20 02:44:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:58,226 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-10-20 02:44:58,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:44:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-10-20 02:44:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:44:58,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:58,229 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-10-20 02:44:58,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 02:44:58,229 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1754318964, now seen corresponding path program 2 times [2020-10-20 02:44:58,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:58,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140653339] [2020-10-20 02:44:58,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:58,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140653339] [2020-10-20 02:44:58,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:58,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 02:44:58,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593020275] [2020-10-20 02:44:58,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 02:44:58,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 02:44:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 02:44:58,373 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 9 states. [2020-10-20 02:44:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:58,566 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2020-10-20 02:44:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:58,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 02:44:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:58,575 INFO L225 Difference]: With dead ends: 3525 [2020-10-20 02:44:58,575 INFO L226 Difference]: Without dead ends: 3465 [2020-10-20 02:44:58,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2020-10-20 02:44:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2020-10-20 02:44:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-20 02:44:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-10-20 02:44:58,633 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-10-20 02:44:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:58,633 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-10-20 02:44:58,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 02:44:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-10-20 02:44:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:44:58,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:58,636 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-10-20 02:44:58,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 02:44:58,636 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash -901390894, now seen corresponding path program 3 times [2020-10-20 02:44:58,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:58,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799329250] [2020-10-20 02:44:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:58,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799329250] [2020-10-20 02:44:58,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:58,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 02:44:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714180269] [2020-10-20 02:44:58,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 02:44:58,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 02:44:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:44:58,766 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2020-10-20 02:44:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:59,117 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2020-10-20 02:44:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:44:59,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 02:44:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:59,128 INFO L225 Difference]: With dead ends: 3740 [2020-10-20 02:44:59,128 INFO L226 Difference]: Without dead ends: 3680 [2020-10-20 02:44:59,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:44:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2020-10-20 02:44:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2020-10-20 02:44:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-20 02:44:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2020-10-20 02:44:59,249 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2020-10-20 02:44:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:59,249 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2020-10-20 02:44:59,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 02:44:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2020-10-20 02:44:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:44:59,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:59,253 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-10-20 02:44:59,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 02:44:59,254 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash -261805906, now seen corresponding path program 4 times [2020-10-20 02:44:59,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:59,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039681860] [2020-10-20 02:44:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:59,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039681860] [2020-10-20 02:44:59,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:59,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 02:44:59,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539392420] [2020-10-20 02:44:59,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 02:44:59,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 02:44:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-20 02:44:59,356 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 9 states. [2020-10-20 02:44:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:44:59,605 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2020-10-20 02:44:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:44:59,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 02:44:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:44:59,617 INFO L225 Difference]: With dead ends: 4237 [2020-10-20 02:44:59,617 INFO L226 Difference]: Without dead ends: 4177 [2020-10-20 02:44:59,617 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-10-20 02:44:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2020-10-20 02:44:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2020-10-20 02:44:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-10-20 02:44:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-10-20 02:44:59,669 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-10-20 02:44:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:44:59,670 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-10-20 02:44:59,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 02:44:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-10-20 02:44:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 02:44:59,672 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:44:59,672 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-10-20 02:44:59,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 02:44:59,672 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:44:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:44:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 618359143, now seen corresponding path program 1 times [2020-10-20 02:44:59,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:44:59,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882700953] [2020-10-20 02:44:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:44:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:44:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:44:59,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882700953] [2020-10-20 02:44:59,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:44:59,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 02:44:59,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851340513] [2020-10-20 02:44:59,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 02:44:59,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:44:59,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 02:44:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:44:59,850 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-10-20 02:45:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:00,198 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2020-10-20 02:45:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:45:00,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-20 02:45:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:00,207 INFO L225 Difference]: With dead ends: 3103 [2020-10-20 02:45:00,207 INFO L226 Difference]: Without dead ends: 3007 [2020-10-20 02:45:00,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-10-20 02:45:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-10-20 02:45:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2020-10-20 02:45:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-20 02:45:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-20 02:45:00,257 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2020-10-20 02:45:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:00,257 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-20 02:45:00,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 02:45:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-20 02:45:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 02:45:00,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:00,260 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-10-20 02:45:00,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-20 02:45:00,260 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1823757131, now seen corresponding path program 1 times [2020-10-20 02:45:00,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:00,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142127183] [2020-10-20 02:45:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:00,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-10-20 02:45:00,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142127183] [2020-10-20 02:45:00,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:00,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:45:00,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685534225] [2020-10-20 02:45:00,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:00,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:00,365 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-20 02:45:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:00,666 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2020-10-20 02:45:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:45:00,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-20 02:45:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:00,674 INFO L225 Difference]: With dead ends: 3115 [2020-10-20 02:45:00,674 INFO L226 Difference]: Without dead ends: 3058 [2020-10-20 02:45:00,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-20 02:45:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-10-20 02:45:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2020-10-20 02:45:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-10-20 02:45:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2020-10-20 02:45:00,712 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2020-10-20 02:45:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:00,712 INFO L481 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2020-10-20 02:45:00,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2020-10-20 02:45:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 02:45:00,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:00,715 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-10-20 02:45:00,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-20 02:45:00,715 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:00,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1618282095, now seen corresponding path program 2 times [2020-10-20 02:45:00,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:00,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696708116] [2020-10-20 02:45:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:00,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696708116] [2020-10-20 02:45:00,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:00,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 02:45:00,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399187622] [2020-10-20 02:45:00,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 02:45:00,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 02:45:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:00,899 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 12 states. [2020-10-20 02:45:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:01,228 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2020-10-20 02:45:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:45:01,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-20 02:45:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:01,234 INFO L225 Difference]: With dead ends: 2799 [2020-10-20 02:45:01,235 INFO L226 Difference]: Without dead ends: 2682 [2020-10-20 02:45:01,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-10-20 02:45:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-10-20 02:45:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2020-10-20 02:45:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-10-20 02:45:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-10-20 02:45:01,266 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-10-20 02:45:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:01,266 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-10-20 02:45:01,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 02:45:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-10-20 02:45:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:01,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:01,268 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-10-20 02:45:01,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-20 02:45:01,268 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1881126218, now seen corresponding path program 1 times [2020-10-20 02:45:01,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:01,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588507593] [2020-10-20 02:45:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:01,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588507593] [2020-10-20 02:45:01,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:01,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:45:01,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277651400] [2020-10-20 02:45:01,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:45:01,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:45:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:45:01,310 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 5 states. [2020-10-20 02:45:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:01,423 INFO L93 Difference]: Finished difference Result 2298 states and 7732 transitions. [2020-10-20 02:45:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:45:01,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-20 02:45:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:01,429 INFO L225 Difference]: With dead ends: 2298 [2020-10-20 02:45:01,429 INFO L226 Difference]: Without dead ends: 2234 [2020-10-20 02:45:01,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:45:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-10-20 02:45:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2113. [2020-10-20 02:45:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2020-10-20 02:45:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 7288 transitions. [2020-10-20 02:45:01,459 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 7288 transitions. Word has length 24 [2020-10-20 02:45:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:01,460 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 7288 transitions. [2020-10-20 02:45:01,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:45:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 7288 transitions. [2020-10-20 02:45:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:01,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:01,462 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-10-20 02:45:01,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-20 02:45:01,462 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1170381166, now seen corresponding path program 2 times [2020-10-20 02:45:01,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:01,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532575150] [2020-10-20 02:45:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:01,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532575150] [2020-10-20 02:45:01,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:01,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:45:01,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893584373] [2020-10-20 02:45:01,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:45:01,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:45:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:45:01,505 INFO L87 Difference]: Start difference. First operand 2113 states and 7288 transitions. Second operand 6 states. [2020-10-20 02:45:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:01,655 INFO L93 Difference]: Finished difference Result 2610 states and 8724 transitions. [2020-10-20 02:45:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:45:01,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-20 02:45:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:01,662 INFO L225 Difference]: With dead ends: 2610 [2020-10-20 02:45:01,662 INFO L226 Difference]: Without dead ends: 2546 [2020-10-20 02:45:01,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:45:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2020-10-20 02:45:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2106. [2020-10-20 02:45:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-20 02:45:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-10-20 02:45:01,695 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-10-20 02:45:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:01,695 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-10-20 02:45:01,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:45:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-10-20 02:45:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:01,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:01,697 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-10-20 02:45:01,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-20 02:45:01,697 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -705054292, now seen corresponding path program 3 times [2020-10-20 02:45:01,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:01,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855068572] [2020-10-20 02:45:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:01,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-10-20 02:45:01,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855068572] [2020-10-20 02:45:01,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:01,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 02:45:01,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729368944] [2020-10-20 02:45:01,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:45:01,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:45:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:45:01,779 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-10-20 02:45:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:02,011 INFO L93 Difference]: Finished difference Result 2590 states and 8691 transitions. [2020-10-20 02:45:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:45:02,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-20 02:45:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:02,017 INFO L225 Difference]: With dead ends: 2590 [2020-10-20 02:45:02,017 INFO L226 Difference]: Without dead ends: 2526 [2020-10-20 02:45:02,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2020-10-20 02:45:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2093. [2020-10-20 02:45:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-10-20 02:45:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-10-20 02:45:02,050 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-10-20 02:45:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:02,050 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-10-20 02:45:02,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:45:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-10-20 02:45:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:02,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:02,053 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-10-20 02:45:02,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-20 02:45:02,053 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1595569430, now seen corresponding path program 1 times [2020-10-20 02:45:02,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:02,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157907242] [2020-10-20 02:45:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:02,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157907242] [2020-10-20 02:45:02,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:02,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:45:02,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36001764] [2020-10-20 02:45:02,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:02,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:02,191 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-10-20 02:45:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:02,419 INFO L93 Difference]: Finished difference Result 2558 states and 8708 transitions. [2020-10-20 02:45:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:45:02,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-20 02:45:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:02,425 INFO L225 Difference]: With dead ends: 2558 [2020-10-20 02:45:02,425 INFO L226 Difference]: Without dead ends: 2534 [2020-10-20 02:45:02,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:45:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2020-10-20 02:45:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2093. [2020-10-20 02:45:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-10-20 02:45:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-10-20 02:45:02,458 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-10-20 02:45:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:02,458 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-10-20 02:45:02,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-10-20 02:45:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:02,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:02,461 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-10-20 02:45:02,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-20 02:45:02,461 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1636815590, now seen corresponding path program 2 times [2020-10-20 02:45:02,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:02,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075869751] [2020-10-20 02:45:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:02,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075869751] [2020-10-20 02:45:02,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:02,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 02:45:02,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844736984] [2020-10-20 02:45:02,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 02:45:02,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 02:45:02,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:45:02,602 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 11 states. [2020-10-20 02:45:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:02,935 INFO L93 Difference]: Finished difference Result 3188 states and 11079 transitions. [2020-10-20 02:45:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 02:45:02,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-20 02:45:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:02,943 INFO L225 Difference]: With dead ends: 3188 [2020-10-20 02:45:02,943 INFO L226 Difference]: Without dead ends: 3164 [2020-10-20 02:45:02,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-10-20 02:45:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2020-10-20 02:45:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 1733. [2020-10-20 02:45:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-10-20 02:45:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-10-20 02:45:03,013 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-10-20 02:45:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:03,014 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-10-20 02:45:03,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 02:45:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-10-20 02:45:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:03,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:03,017 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-10-20 02:45:03,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-20 02:45:03,018 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -645522248, now seen corresponding path program 4 times [2020-10-20 02:45:03,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:03,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950246370] [2020-10-20 02:45:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:03,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950246370] [2020-10-20 02:45:03,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:03,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:45:03,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513192952] [2020-10-20 02:45:03,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:03,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:03,177 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 10 states. [2020-10-20 02:45:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:03,512 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2020-10-20 02:45:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:45:03,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-20 02:45:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:03,517 INFO L225 Difference]: With dead ends: 2175 [2020-10-20 02:45:03,517 INFO L226 Difference]: Without dead ends: 2111 [2020-10-20 02:45:03,518 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-10-20 02:45:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-10-20 02:45:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2020-10-20 02:45:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-10-20 02:45:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-10-20 02:45:03,557 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-10-20 02:45:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:03,557 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-10-20 02:45:03,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-10-20 02:45:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:03,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:03,560 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-10-20 02:45:03,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-20 02:45:03,560 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash -651468708, now seen corresponding path program 5 times [2020-10-20 02:45:03,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:03,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590950092] [2020-10-20 02:45:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:03,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590950092] [2020-10-20 02:45:03,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:03,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 02:45:03,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651334759] [2020-10-20 02:45:03,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 02:45:03,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 02:45:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:03,737 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2020-10-20 02:45:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:04,027 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2020-10-20 02:45:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:45:04,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-20 02:45:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:04,032 INFO L225 Difference]: With dead ends: 2400 [2020-10-20 02:45:04,032 INFO L226 Difference]: Without dead ends: 2272 [2020-10-20 02:45:04,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-10-20 02:45:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-10-20 02:45:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2020-10-20 02:45:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-10-20 02:45:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2020-10-20 02:45:04,073 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2020-10-20 02:45:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:04,074 INFO L481 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2020-10-20 02:45:04,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 02:45:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2020-10-20 02:45:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:45:04,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:04,077 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-10-20 02:45:04,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-20 02:45:04,077 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1516154866, now seen corresponding path program 6 times [2020-10-20 02:45:04,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:04,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694262926] [2020-10-20 02:45:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:04,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694262926] [2020-10-20 02:45:04,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:04,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:45:04,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389248271] [2020-10-20 02:45:04,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:04,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:04,272 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 10 states. [2020-10-20 02:45:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:04,528 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2020-10-20 02:45:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:45:04,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-20 02:45:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:04,533 INFO L225 Difference]: With dead ends: 2576 [2020-10-20 02:45:04,534 INFO L226 Difference]: Without dead ends: 2512 [2020-10-20 02:45:04,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:45:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2020-10-20 02:45:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2020-10-20 02:45:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2020-10-20 02:45:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2020-10-20 02:45:04,558 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2020-10-20 02:45:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:04,559 INFO L481 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2020-10-20 02:45:04,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2020-10-20 02:45:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:45:04,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:04,561 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-10-20 02:45:04,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-20 02:45:04,561 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1490897436, now seen corresponding path program 1 times [2020-10-20 02:45:04,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:04,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424893036] [2020-10-20 02:45:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:04,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424893036] [2020-10-20 02:45:04,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:04,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 02:45:04,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103581394] [2020-10-20 02:45:04,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:04,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:04,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:04,671 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 10 states. [2020-10-20 02:45:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:04,927 INFO L93 Difference]: Finished difference Result 2094 states and 6830 transitions. [2020-10-20 02:45:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:45:04,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-20 02:45:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:04,932 INFO L225 Difference]: With dead ends: 2094 [2020-10-20 02:45:04,932 INFO L226 Difference]: Without dead ends: 2072 [2020-10-20 02:45:04,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-20 02:45:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2020-10-20 02:45:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1485. [2020-10-20 02:45:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-10-20 02:45:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2020-10-20 02:45:04,956 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2020-10-20 02:45:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:04,957 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2020-10-20 02:45:04,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2020-10-20 02:45:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:45:04,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:04,959 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-10-20 02:45:04,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-20 02:45:04,959 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1992969286, now seen corresponding path program 2 times [2020-10-20 02:45:04,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:04,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787719632] [2020-10-20 02:45:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:05,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787719632] [2020-10-20 02:45:05,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:05,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 02:45:05,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879844549] [2020-10-20 02:45:05,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 02:45:05,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 02:45:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:05,110 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2020-10-20 02:45:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:05,528 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2020-10-20 02:45:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 02:45:05,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-20 02:45:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:05,535 INFO L225 Difference]: With dead ends: 1538 [2020-10-20 02:45:05,536 INFO L226 Difference]: Without dead ends: 1494 [2020-10-20 02:45:05,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-20 02:45:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-10-20 02:45:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2020-10-20 02:45:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-20 02:45:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-20 02:45:05,560 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-20 02:45:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:05,561 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-20 02:45:05,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 02:45:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-20 02:45:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 02:45:05,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:05,571 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-10-20 02:45:05,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-10-20 02:45:05,572 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1378312331, now seen corresponding path program 1 times [2020-10-20 02:45:05,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:05,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704322049] [2020-10-20 02:45:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:05,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704322049] [2020-10-20 02:45:05,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:05,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 02:45:05,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796444008] [2020-10-20 02:45:05,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:45:05,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:45:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:45:05,648 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-20 02:45:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:05,768 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-20 02:45:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:45:05,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-20 02:45:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:05,771 INFO L225 Difference]: With dead ends: 885 [2020-10-20 02:45:05,771 INFO L226 Difference]: Without dead ends: 867 [2020-10-20 02:45:05,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2020-10-20 02:45:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2020-10-20 02:45:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2020-10-20 02:45:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2960 transitions. [2020-10-20 02:45:05,790 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 2960 transitions. Word has length 41 [2020-10-20 02:45:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:05,790 INFO L481 AbstractCegarLoop]: Abstraction has 867 states and 2960 transitions. [2020-10-20 02:45:05,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:45:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2960 transitions. [2020-10-20 02:45:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 02:45:05,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:05,793 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-10-20 02:45:05,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-20 02:45:05,793 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash 797706649, now seen corresponding path program 1 times [2020-10-20 02:45:05,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:05,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993217165] [2020-10-20 02:45:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:05,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993217165] [2020-10-20 02:45:05,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:05,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 02:45:05,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818420606] [2020-10-20 02:45:05,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:45:05,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:05,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:45:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:45:05,868 INFO L87 Difference]: Start difference. First operand 867 states and 2960 transitions. Second operand 8 states. [2020-10-20 02:45:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:06,004 INFO L93 Difference]: Finished difference Result 867 states and 2956 transitions. [2020-10-20 02:45:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:45:06,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-20 02:45:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:06,008 INFO L225 Difference]: With dead ends: 867 [2020-10-20 02:45:06,008 INFO L226 Difference]: Without dead ends: 819 [2020-10-20 02:45:06,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-20 02:45:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-20 02:45:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-20 02:45:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-20 02:45:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-20 02:45:06,021 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-20 02:45:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:06,022 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-20 02:45:06,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:45:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-20 02:45:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 02:45:06,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:06,023 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-10-20 02:45:06,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-20 02:45:06,024 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash -179469333, now seen corresponding path program 1 times [2020-10-20 02:45:06,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:06,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90230186] [2020-10-20 02:45:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:45:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:45:06,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90230186] [2020-10-20 02:45:06,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:45:06,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 02:45:06,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100124963] [2020-10-20 02:45:06,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 02:45:06,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:45:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 02:45:06,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:45:06,167 INFO L87 Difference]: Start difference. First operand 819 states and 2784 transitions. Second operand 10 states. [2020-10-20 02:45:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:45:06,327 INFO L93 Difference]: Finished difference Result 819 states and 2776 transitions. [2020-10-20 02:45:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:45:06,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-10-20 02:45:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:45:06,330 INFO L225 Difference]: With dead ends: 819 [2020-10-20 02:45:06,330 INFO L226 Difference]: Without dead ends: 735 [2020-10-20 02:45:06,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-10-20 02:45:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2020-10-20 02:45:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2020-10-20 02:45:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-10-20 02:45:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2470 transitions. [2020-10-20 02:45:06,342 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 2470 transitions. Word has length 41 [2020-10-20 02:45:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:45:06,342 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 2470 transitions. [2020-10-20 02:45:06,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 02:45:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 2470 transitions. [2020-10-20 02:45:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 02:45:06,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:45:06,344 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-10-20 02:45:06,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-20 02:45:06,344 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-10-20 02:45:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:45:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1631305437, now seen corresponding path program 1 times [2020-10-20 02:45:06,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:45:06,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118720777] [2020-10-20 02:45:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:45:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:45:06,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:45:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:45:06,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:45:06,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:45:06,437 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:45:06,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-20 02:45:06,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:45:06 BasicIcfg [2020-10-20 02:45:06,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:45:06,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:45:06,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:45:06,585 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:45:06,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:44:36" (3/4) ... [2020-10-20 02:45:06,590 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:45:06,712 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:45:06,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:45:06,714 INFO L168 Benchmark]: Toolchain (without parser) took 31702.72 ms. Allocated memory was 41.9 MB in the beginning and 406.3 MB in the end (delta: 364.4 MB). Free memory was 19.9 MB in the beginning and 315.6 MB in the end (delta: -295.7 MB). Peak memory consumption was 308.2 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,714 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 32.0 MB. Free memory was 9.7 MB in the beginning and 9.7 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.87 ms. Allocated memory was 41.9 MB in the beginning and 48.8 MB in the end (delta: 6.8 MB). Free memory was 19.0 MB in the beginning and 13.1 MB in the end (delta: 5.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.56 ms. Allocated memory is still 48.8 MB. Free memory was 13.1 MB in the beginning and 10.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,715 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 48.8 MB. Free memory was 10.7 MB in the beginning and 31.1 MB in the end (delta: -20.4 MB). Peak memory consumption was 8.2 kB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,716 INFO L168 Benchmark]: RCFGBuilder took 509.12 ms. Allocated memory was 48.8 MB in the beginning and 52.4 MB in the end (delta: 3.7 MB). Free memory was 31.1 MB in the beginning and 23.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,716 INFO L168 Benchmark]: TraceAbstraction took 30075.34 ms. Allocated memory was 52.4 MB in the beginning and 404.2 MB in the end (delta: 351.8 MB). Free memory was 23.3 MB in the beginning and 80.6 MB in the end (delta: -57.3 MB). Peak memory consumption was 294.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,717 INFO L168 Benchmark]: Witness Printer took 127.15 ms. Allocated memory was 404.2 MB in the beginning and 406.3 MB in the end (delta: 2.1 MB). Free memory was 80.6 MB in the beginning and 315.6 MB in the end (delta: -235.0 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. [2020-10-20 02:45:06,720 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.32 ms. Allocated memory is still 32.0 MB. Free memory was 9.7 MB in the beginning and 9.7 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 879.87 ms. Allocated memory was 41.9 MB in the beginning and 48.8 MB in the end (delta: 6.8 MB). Free memory was 19.0 MB in the beginning and 13.1 MB in the end (delta: 5.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 54.56 ms. Allocated memory is still 48.8 MB. Free memory was 13.1 MB in the beginning and 10.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 48.8 MB. Free memory was 10.7 MB in the beginning and 31.1 MB in the end (delta: -20.4 MB). Peak memory consumption was 8.2 kB. Max. memory is 14.3 GB. * RCFGBuilder took 509.12 ms. Allocated memory was 48.8 MB in the beginning and 52.4 MB in the end (delta: 3.7 MB). Free memory was 31.1 MB in the beginning and 23.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 30075.34 ms. Allocated memory was 52.4 MB in the beginning and 404.2 MB in the end (delta: 351.8 MB). Free memory was 23.3 MB in the beginning and 80.6 MB in the end (delta: -57.3 MB). Peak memory consumption was 294.5 MB. Max. memory is 14.3 GB. * Witness Printer took 127.15 ms. Allocated memory was 404.2 MB in the beginning and 406.3 MB in the end (delta: 2.1 MB). Free memory was 80.6 MB in the beginning and 315.6 MB in the end (delta: -235.0 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3872 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 1174 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.8s, 180 PlacesBefore, 101 PlacesAfterwards, 252 TransitionsBefore, 173 TransitionsAfterwards, 4628 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 52821 MoverChecksTotal - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1116] 0 char *v; [L1153] 0 pthread_t t; [L1154] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1155] 0 \read(t) VAL [arg={0:0}, v={0:0}] [L1138] 1 pthread_t t1, t2, t3, t4, t5; [L1139] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={0:0}] [L1140] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={0:0}] [L1119] 2 v = malloc(sizeof(char)) [L1120] 2 return 0; [L1140] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1141] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1142] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1125] 3 v[0] = 'X' [L1127] 3 return 0; [L1143] FCALL, FORK 1 pthread_create(&t4, 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}, malloc(sizeof(char))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1144] 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}, malloc(sizeof(char))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1145] 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}, malloc(sizeof(char))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1145] 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}, malloc(sizeof(char))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1146] 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}, malloc(sizeof(char))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1125] 6 v[0] = 'X' [L1127] 6 return 0; [L1125] 5 v[0] = 'X' [L1127] 5 return 0; [L1132] 4 v[0] = 'Y' [L1134] 4 return 0; [L1146] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1147] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1147] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1148] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1148] 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))={-1:0}, t1={13:0}, t2={14:0}, t3={11:0}, t4={10:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1155] 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))={-1:0}, v={-1:0}] [L1156] 0 v[0] [L1115] COND TRUE 0 !expression [L12] COND FALSE 0 !(0) [L12] 0 __assert_fail ("0", "singleton.c", 3, __extension__ __PRETTY_FUNCTION__) 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))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.5s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 5020 SDtfs, 9342 SDslu, 12893 SDs, 0 SdLazy, 7709 SolverSat, 1105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4277occurred 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: 5.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 43479 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 217984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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...