./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer --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 081154e787322e3b9ad682661fd03964eab6d0d9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:32:16,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:32:16,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:32:16,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:32:16,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:32:16,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:32:16,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:32:16,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:32:16,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:32:16,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:32:16,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:32:16,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:32:16,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:32:16,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:32:16,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:32:16,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:32:16,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:32:16,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:32:16,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:32:16,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:32:16,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:32:16,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:32:16,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:32:16,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:32:16,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:32:16,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:32:16,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:32:16,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:32:16,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:32:16,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:32:16,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:32:16,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:32:16,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:32:16,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:32:16,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:32:16,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:32:16,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:32:16,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:32:16,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:32:16,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:32:16,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:32:16,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:32:16,235 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:32:16,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:32:16,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:32:16,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:32:16,237 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:32:16,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:32:16,238 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:32:16,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:32:16,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:32:16,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:32:16,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:32:16,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:32:16,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:32:16,239 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:32:16,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:32:16,240 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:32:16,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:32:16,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:32:16,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:32:16,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:32:16,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:32:16,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:32:16,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:32:16,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:32:16,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:32:16,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:32:16,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:32:16,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:32:16,243 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:32:16,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer 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 -> 081154e787322e3b9ad682661fd03964eab6d0d9 [2020-11-30 01:32:16,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:32:16,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:32:16,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:32:16,578 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:32:16,579 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:32:16,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2020-11-30 01:32:16,659 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/data/2eed6c27a/5eb978af01c0495782a9e0169e0ef417/FLAG746091b04 [2020-11-30 01:32:17,422 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:32:17,426 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2020-11-30 01:32:17,460 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/data/2eed6c27a/5eb978af01c0495782a9e0169e0ef417/FLAG746091b04 [2020-11-30 01:32:17,572 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/data/2eed6c27a/5eb978af01c0495782a9e0169e0ef417 [2020-11-30 01:32:17,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:32:17,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:32:17,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:32:17,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:32:17,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:32:17,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:32:17" (1/1) ... [2020-11-30 01:32:17,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:17, skipping insertion in model container [2020-11-30 01:32:17,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:32:17" (1/1) ... [2020-11-30 01:32:17,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:32:17,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:32:18,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:32:18,962 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:32:19,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:32:19,512 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:32:19,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19 WrapperNode [2020-11-30 01:32:19,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:32:19,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:32:19,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:32:19,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:32:19,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:32:19,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:32:19,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:32:19,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:32:19,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... [2020-11-30 01:32:19,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:32:19,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:32:19,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:32:19,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:32:19,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/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-11-30 01:32:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:32:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:32:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-11-30 01:32:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:32:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:32:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:32:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-30 01:32:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-30 01:32:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:32:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:32:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:32:19,852 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:32:20,827 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:32:20,830 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-30 01:32:20,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:32:20 BoogieIcfgContainer [2020-11-30 01:32:20,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:32:20,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:32:20,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:32:20,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:32:20,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:32:17" (1/3) ... [2020-11-30 01:32:20,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f9c8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:32:20, skipping insertion in model container [2020-11-30 01:32:20,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:32:19" (2/3) ... [2020-11-30 01:32:20,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f9c8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:32:20, skipping insertion in model container [2020-11-30 01:32:20,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:32:20" (3/3) ... [2020-11-30 01:32:20,848 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-11-30 01:32:20,861 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:32:20,862 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:32:20,867 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-30 01:32:20,868 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:32:20,919 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,919 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,920 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,920 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,920 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,921 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,921 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,921 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,921 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,921 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,922 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,922 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,922 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,922 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,923 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,923 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,923 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,923 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,924 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,924 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,925 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,926 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,926 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,927 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,929 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,929 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,929 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,930 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,930 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,930 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,931 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,932 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,932 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,932 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,932 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,933 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,934 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,935 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,935 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,935 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,935 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,936 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,936 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,936 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,937 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,937 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,938 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,939 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,940 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,940 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,940 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,941 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,941 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,942 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,942 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,942 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,942 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,943 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,943 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,943 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,944 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,944 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,945 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,950 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,950 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,951 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,952 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,953 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,953 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,960 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,960 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,960 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,960 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,961 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,961 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,962 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,962 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,962 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:32:20,986 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-30 01:32:21,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-30 01:32:21,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:32:21,022 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:32:21,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:32:21,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:32:21,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:32:21,023 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:32:21,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:32:21,023 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:32:21,045 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:32:21,048 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 189 transitions, 400 flow [2020-11-30 01:32:21,053 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 189 transitions, 400 flow [2020-11-30 01:32:21,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 179 places, 189 transitions, 400 flow [2020-11-30 01:32:21,203 INFO L129 PetriNetUnfolder]: 19/237 cut-off events. [2020-11-30 01:32:21,203 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-30 01:32:21,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 508 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-11-30 01:32:21,220 INFO L116 LiptonReduction]: Number of co-enabled transitions 3444 [2020-11-30 01:32:22,131 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,160 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,180 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,180 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-11-30 01:32:22,716 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,752 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,774 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,775 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:22,793 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:22,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:22,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:25,180 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:25,217 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:25,243 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,243 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:25,272 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:25,318 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:25,351 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:25,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:27,484 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:27,521 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:27,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,554 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:27,569 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:27,604 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:27,627 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:27,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:29,987 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:30,031 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:30,053 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,053 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-11-30 01:32:30,074 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:30,120 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:30,147 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:30,148 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-30 01:32:32,516 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:32,552 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:32,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,576 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-11-30 01:32:32,586 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:32,608 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:32,623 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:32,623 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-30 01:32:35,823 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:35,855 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:35,876 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,876 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-30 01:32:35,898 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:35,931 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:35,955 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:35,956 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-11-30 01:32:38,224 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:38,254 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:38,276 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,276 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-30 01:32:38,309 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:38,362 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:38,406 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:38,406 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-30 01:32:40,449 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:40,521 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:40,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:40,559 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:40,586 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:40,604 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:40,604 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-30 01:32:42,903 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 01:32:43,081 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 01:32:43,268 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-30 01:32:43,542 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-11-30 01:32:43,845 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 01:32:43,857 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:43,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:43,894 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:43,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:43,913 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:43,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-30 01:32:44,236 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-11-30 01:32:44,377 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 01:32:45,822 WARN L193 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-11-30 01:32:46,208 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-30 01:32:46,468 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-11-30 01:32:46,664 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-11-30 01:32:46,805 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-11-30 01:32:46,973 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-11-30 01:32:48,623 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 168 DAG size of output: 164 [2020-11-30 01:32:48,671 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:49,348 WARN L193 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2020-11-30 01:32:49,349 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:49,363 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:49,948 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-11-30 01:32:49,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:32:49,949 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:32:49,950 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-30 01:32:50,530 WARN L193 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-11-30 01:32:51,352 WARN L193 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158 [2020-11-30 01:32:51,785 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-11-30 01:32:51,806 INFO L131 LiptonReduction]: Checked pairs total: 7933 [2020-11-30 01:32:51,806 INFO L133 LiptonReduction]: Total number of compositions: 237 [2020-11-30 01:32:51,815 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-11-30 01:32:51,846 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-11-30 01:32:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-11-30 01:32:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-30 01:32:51,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:51,853 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-30 01:32:51,854 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 1 times [2020-11-30 01:32:51,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:51,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145445702] [2020-11-30 01:32:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:52,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145445702] [2020-11-30 01:32:52,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:52,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-30 01:32:52,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244100141] [2020-11-30 01:32:52,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 01:32:52,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:32:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:32:52,172 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-11-30 01:32:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:52,221 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-11-30 01:32:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:32:52,222 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-30 01:32:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:52,237 INFO L225 Difference]: With dead ends: 423 [2020-11-30 01:32:52,238 INFO L226 Difference]: Without dead ends: 385 [2020-11-30 01:32:52,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:32:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-30 01:32:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-11-30 01:32:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-30 01:32:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-11-30 01:32:52,334 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-11-30 01:32:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:52,336 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-11-30 01:32:52,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 01:32:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-11-30 01:32:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 01:32:52,337 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:52,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 01:32:52,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:32:52,337 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash 22064617, now seen corresponding path program 1 times [2020-11-30 01:32:52,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:52,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019814606] [2020-11-30 01:32:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:52,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019814606] [2020-11-30 01:32:52,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:52,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:32:52,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005978721] [2020-11-30 01:32:52,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:32:52,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:52,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:32:52,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:32:52,580 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-11-30 01:32:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:52,687 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-11-30 01:32:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:32:52,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-30 01:32:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:52,695 INFO L225 Difference]: With dead ends: 540 [2020-11-30 01:32:52,695 INFO L226 Difference]: Without dead ends: 540 [2020-11-30 01:32:52,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:32:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-11-30 01:32:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-11-30 01:32:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-30 01:32:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-11-30 01:32:52,724 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-11-30 01:32:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:52,724 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-11-30 01:32:52,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:32:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-11-30 01:32:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:32:52,725 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:52,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:32:52,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:32:52,725 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -270739087, now seen corresponding path program 1 times [2020-11-30 01:32:52,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:52,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120446325] [2020-11-30 01:32:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:52,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120446325] [2020-11-30 01:32:52,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:52,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:32:52,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221441019] [2020-11-30 01:32:52,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:32:52,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:52,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:32:52,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:32:52,869 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 5 states. [2020-11-30 01:32:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:53,152 INFO L93 Difference]: Finished difference Result 600 states and 1430 transitions. [2020-11-30 01:32:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:32:53,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-11-30 01:32:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:53,158 INFO L225 Difference]: With dead ends: 600 [2020-11-30 01:32:53,158 INFO L226 Difference]: Without dead ends: 514 [2020-11-30 01:32:53,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:32:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-30 01:32:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-11-30 01:32:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-30 01:32:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-11-30 01:32:53,181 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-11-30 01:32:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:53,181 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-11-30 01:32:53,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:32:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-11-30 01:32:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:32:53,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:53,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:53,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:32:53,185 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1711454574, now seen corresponding path program 1 times [2020-11-30 01:32:53,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:53,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92427582] [2020-11-30 01:32:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:53,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92427582] [2020-11-30 01:32:53,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:53,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:32:53,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122364672] [2020-11-30 01:32:53,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:32:53,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:32:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:32:53,272 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-11-30 01:32:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:53,285 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-11-30 01:32:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:32:53,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 01:32:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:53,288 INFO L225 Difference]: With dead ends: 162 [2020-11-30 01:32:53,288 INFO L226 Difference]: Without dead ends: 162 [2020-11-30 01:32:53,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-30 01:32:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-30 01:32:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-30 01:32:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-30 01:32:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-11-30 01:32:53,294 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-11-30 01:32:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:53,294 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-11-30 01:32:53,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:32:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-11-30 01:32:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:53,302 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:53,302 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-11-30 01:32:53,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:32:53,303 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1613525791, now seen corresponding path program 1 times [2020-11-30 01:32:53,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:53,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061994717] [2020-11-30 01:32:53,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:53,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061994717] [2020-11-30 01:32:53,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:53,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:32:53,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422787232] [2020-11-30 01:32:53,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:32:53,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:32:53,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:32:53,550 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-11-30 01:32:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:53,935 INFO L93 Difference]: Finished difference Result 194 states and 403 transitions. [2020-11-30 01:32:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:32:53,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-30 01:32:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:53,937 INFO L225 Difference]: With dead ends: 194 [2020-11-30 01:32:53,937 INFO L226 Difference]: Without dead ends: 194 [2020-11-30 01:32:53,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:32:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-30 01:32:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2020-11-30 01:32:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-30 01:32:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 389 transitions. [2020-11-30 01:32:53,943 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 389 transitions. Word has length 22 [2020-11-30 01:32:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:53,943 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 389 transitions. [2020-11-30 01:32:53,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:32:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 389 transitions. [2020-11-30 01:32:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:53,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:53,946 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-11-30 01:32:53,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:32:53,946 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -721777329, now seen corresponding path program 1 times [2020-11-30 01:32:53,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:53,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461090452] [2020-11-30 01:32:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:54,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461090452] [2020-11-30 01:32:54,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:54,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:32:54,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208775203] [2020-11-30 01:32:54,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:32:54,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:32:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:32:54,163 INFO L87 Difference]: Start difference. First operand 186 states and 389 transitions. Second operand 6 states. [2020-11-30 01:32:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:54,270 INFO L93 Difference]: Finished difference Result 226 states and 457 transitions. [2020-11-30 01:32:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:32:54,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-30 01:32:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:54,274 INFO L225 Difference]: With dead ends: 226 [2020-11-30 01:32:54,274 INFO L226 Difference]: Without dead ends: 226 [2020-11-30 01:32:54,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:32:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-11-30 01:32:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2020-11-30 01:32:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-30 01:32:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 409 transitions. [2020-11-30 01:32:54,283 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 409 transitions. Word has length 22 [2020-11-30 01:32:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:54,283 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 409 transitions. [2020-11-30 01:32:54,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:32:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 409 transitions. [2020-11-30 01:32:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:54,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:54,285 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-11-30 01:32:54,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:32:54,285 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795979, now seen corresponding path program 2 times [2020-11-30 01:32:54,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:54,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934417850] [2020-11-30 01:32:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:55,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934417850] [2020-11-30 01:32:55,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:55,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:32:55,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381270320] [2020-11-30 01:32:55,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:32:55,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:32:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:32:55,491 INFO L87 Difference]: Start difference. First operand 198 states and 409 transitions. Second operand 14 states. [2020-11-30 01:32:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:56,527 INFO L93 Difference]: Finished difference Result 227 states and 452 transitions. [2020-11-30 01:32:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:32:56,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:32:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:56,529 INFO L225 Difference]: With dead ends: 227 [2020-11-30 01:32:56,530 INFO L226 Difference]: Without dead ends: 227 [2020-11-30 01:32:56,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:32:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-11-30 01:32:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2020-11-30 01:32:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-11-30 01:32:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 452 transitions. [2020-11-30 01:32:56,538 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 452 transitions. Word has length 22 [2020-11-30 01:32:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:56,538 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 452 transitions. [2020-11-30 01:32:56,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:32:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 452 transitions. [2020-11-30 01:32:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:56,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:56,539 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-11-30 01:32:56,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:32:56,540 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1148795934, now seen corresponding path program 1 times [2020-11-30 01:32:56,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:56,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390498978] [2020-11-30 01:32:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:56,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390498978] [2020-11-30 01:32:56,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:56,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:32:56,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108241080] [2020-11-30 01:32:56,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:32:56,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:32:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:32:56,882 INFO L87 Difference]: Start difference. First operand 226 states and 452 transitions. Second operand 9 states. [2020-11-30 01:32:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:57,369 INFO L93 Difference]: Finished difference Result 295 states and 565 transitions. [2020-11-30 01:32:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:32:57,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-30 01:32:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:57,372 INFO L225 Difference]: With dead ends: 295 [2020-11-30 01:32:57,372 INFO L226 Difference]: Without dead ends: 265 [2020-11-30 01:32:57,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:32:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-11-30 01:32:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 227. [2020-11-30 01:32:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-11-30 01:32:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 456 transitions. [2020-11-30 01:32:57,382 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 456 transitions. Word has length 22 [2020-11-30 01:32:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:57,382 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 456 transitions. [2020-11-30 01:32:57,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:32:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 456 transitions. [2020-11-30 01:32:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:57,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:57,384 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-11-30 01:32:57,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:32:57,384 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 235549017, now seen corresponding path program 3 times [2020-11-30 01:32:57,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:57,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698842826] [2020-11-30 01:32:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:58,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698842826] [2020-11-30 01:32:58,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:58,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:32:58,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986231973] [2020-11-30 01:32:58,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:32:58,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:32:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:32:58,447 INFO L87 Difference]: Start difference. First operand 227 states and 456 transitions. Second operand 14 states. [2020-11-30 01:32:58,957 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-11-30 01:32:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:59,517 INFO L93 Difference]: Finished difference Result 257 states and 502 transitions. [2020-11-30 01:32:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:32:59,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:32:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:59,519 INFO L225 Difference]: With dead ends: 257 [2020-11-30 01:32:59,519 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 01:32:59,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:32:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 01:32:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-11-30 01:32:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-30 01:32:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 459 transitions. [2020-11-30 01:32:59,528 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 459 transitions. Word has length 22 [2020-11-30 01:32:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:59,528 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 459 transitions. [2020-11-30 01:32:59,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:32:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 459 transitions. [2020-11-30 01:32:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:32:59,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:59,530 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-11-30 01:32:59,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:32:59,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1400369243, now seen corresponding path program 4 times [2020-11-30 01:32:59,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:59,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593452207] [2020-11-30 01:32:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:00,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593452207] [2020-11-30 01:33:00,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:00,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:00,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475000348] [2020-11-30 01:33:00,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:00,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:00,495 INFO L87 Difference]: Start difference. First operand 229 states and 459 transitions. Second operand 14 states. [2020-11-30 01:33:00,807 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-11-30 01:33:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:01,555 INFO L93 Difference]: Finished difference Result 280 states and 545 transitions. [2020-11-30 01:33:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:01,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:01,558 INFO L225 Difference]: With dead ends: 280 [2020-11-30 01:33:01,558 INFO L226 Difference]: Without dead ends: 253 [2020-11-30 01:33:01,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-11-30 01:33:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2020-11-30 01:33:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-30 01:33:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 465 transitions. [2020-11-30 01:33:01,566 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 465 transitions. Word has length 22 [2020-11-30 01:33:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:01,567 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 465 transitions. [2020-11-30 01:33:01,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 465 transitions. [2020-11-30 01:33:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:01,568 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:01,568 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-11-30 01:33:01,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:33:01,569 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash -223372275, now seen corresponding path program 5 times [2020-11-30 01:33:01,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:01,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189547306] [2020-11-30 01:33:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:02,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189547306] [2020-11-30 01:33:02,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:02,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:02,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565834232] [2020-11-30 01:33:02,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:02,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:02,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:02,480 INFO L87 Difference]: Start difference. First operand 233 states and 465 transitions. Second operand 14 states. [2020-11-30 01:33:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:03,643 INFO L93 Difference]: Finished difference Result 273 states and 529 transitions. [2020-11-30 01:33:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:03,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:03,647 INFO L225 Difference]: With dead ends: 273 [2020-11-30 01:33:03,647 INFO L226 Difference]: Without dead ends: 273 [2020-11-30 01:33:03,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-30 01:33:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2020-11-30 01:33:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-11-30 01:33:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 518 transitions. [2020-11-30 01:33:03,659 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 518 transitions. Word has length 22 [2020-11-30 01:33:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:03,659 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 518 transitions. [2020-11-30 01:33:03,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 518 transitions. [2020-11-30 01:33:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:03,662 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:03,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:33:03,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:33:03,663 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -223372320, now seen corresponding path program 2 times [2020-11-30 01:33:03,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:03,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178948446] [2020-11-30 01:33:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:04,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178948446] [2020-11-30 01:33:04,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:04,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:33:04,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916575] [2020-11-30 01:33:04,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:33:04,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:33:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:33:04,127 INFO L87 Difference]: Start difference. First operand 266 states and 518 transitions. Second operand 9 states. [2020-11-30 01:33:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:04,586 INFO L93 Difference]: Finished difference Result 367 states and 686 transitions. [2020-11-30 01:33:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:33:04,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-30 01:33:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:04,589 INFO L225 Difference]: With dead ends: 367 [2020-11-30 01:33:04,589 INFO L226 Difference]: Without dead ends: 338 [2020-11-30 01:33:04,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-11-30 01:33:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 258. [2020-11-30 01:33:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-30 01:33:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 514 transitions. [2020-11-30 01:33:04,600 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 514 transitions. Word has length 22 [2020-11-30 01:33:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:04,601 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 514 transitions. [2020-11-30 01:33:04,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:33:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 514 transitions. [2020-11-30 01:33:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:04,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:04,602 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-11-30 01:33:04,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:33:04,603 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 783436301, now seen corresponding path program 6 times [2020-11-30 01:33:04,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:04,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819815656] [2020-11-30 01:33:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:05,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819815656] [2020-11-30 01:33:05,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:05,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:05,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231255999] [2020-11-30 01:33:05,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:05,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:05,695 INFO L87 Difference]: Start difference. First operand 258 states and 514 transitions. Second operand 14 states. [2020-11-30 01:33:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:06,549 INFO L93 Difference]: Finished difference Result 284 states and 551 transitions. [2020-11-30 01:33:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:33:06,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:06,551 INFO L225 Difference]: With dead ends: 284 [2020-11-30 01:33:06,551 INFO L226 Difference]: Without dead ends: 267 [2020-11-30 01:33:06,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-11-30 01:33:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2020-11-30 01:33:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-11-30 01:33:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 520 transitions. [2020-11-30 01:33:06,560 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 520 transitions. Word has length 22 [2020-11-30 01:33:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:06,560 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 520 transitions. [2020-11-30 01:33:06,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 520 transitions. [2020-11-30 01:33:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:06,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:06,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] [2020-11-30 01:33:06,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:33:06,561 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -617705459, now seen corresponding path program 7 times [2020-11-30 01:33:06,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:06,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462252671] [2020-11-30 01:33:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:07,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462252671] [2020-11-30 01:33:07,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:07,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:07,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168096220] [2020-11-30 01:33:07,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:07,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:07,222 INFO L87 Difference]: Start difference. First operand 262 states and 520 transitions. Second operand 14 states. [2020-11-30 01:33:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:07,935 INFO L93 Difference]: Finished difference Result 273 states and 531 transitions. [2020-11-30 01:33:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:07,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:07,937 INFO L225 Difference]: With dead ends: 273 [2020-11-30 01:33:07,937 INFO L226 Difference]: Without dead ends: 244 [2020-11-30 01:33:07,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-11-30 01:33:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2020-11-30 01:33:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-11-30 01:33:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 491 transitions. [2020-11-30 01:33:07,944 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 491 transitions. Word has length 22 [2020-11-30 01:33:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:07,944 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 491 transitions. [2020-11-30 01:33:07,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 491 transitions. [2020-11-30 01:33:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:07,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:07,945 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-11-30 01:33:07,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:33:07,946 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash 207084251, now seen corresponding path program 8 times [2020-11-30 01:33:07,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:07,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797446378] [2020-11-30 01:33:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:09,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797446378] [2020-11-30 01:33:09,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:09,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:09,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669766330] [2020-11-30 01:33:09,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:09,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:09,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:09,028 INFO L87 Difference]: Start difference. First operand 244 states and 491 transitions. Second operand 14 states. [2020-11-30 01:33:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:09,991 INFO L93 Difference]: Finished difference Result 290 states and 574 transitions. [2020-11-30 01:33:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:09,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:09,993 INFO L225 Difference]: With dead ends: 290 [2020-11-30 01:33:09,993 INFO L226 Difference]: Without dead ends: 262 [2020-11-30 01:33:09,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-30 01:33:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 243. [2020-11-30 01:33:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-30 01:33:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 489 transitions. [2020-11-30 01:33:10,001 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 489 transitions. Word has length 22 [2020-11-30 01:33:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:10,001 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 489 transitions. [2020-11-30 01:33:10,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 489 transitions. [2020-11-30 01:33:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:10,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:10,002 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-11-30 01:33:10,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:33:10,003 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1428834009, now seen corresponding path program 9 times [2020-11-30 01:33:10,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:10,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191341478] [2020-11-30 01:33:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:10,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191341478] [2020-11-30 01:33:10,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:10,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:10,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986687631] [2020-11-30 01:33:10,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:10,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:10,815 INFO L87 Difference]: Start difference. First operand 243 states and 489 transitions. Second operand 14 states. [2020-11-30 01:33:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:11,799 INFO L93 Difference]: Finished difference Result 313 states and 617 transitions. [2020-11-30 01:33:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:11,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:11,802 INFO L225 Difference]: With dead ends: 313 [2020-11-30 01:33:11,802 INFO L226 Difference]: Without dead ends: 286 [2020-11-30 01:33:11,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-11-30 01:33:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2020-11-30 01:33:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-11-30 01:33:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 495 transitions. [2020-11-30 01:33:11,811 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 495 transitions. Word has length 22 [2020-11-30 01:33:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:11,811 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 495 transitions. [2020-11-30 01:33:11,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 495 transitions. [2020-11-30 01:33:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:11,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:11,812 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-11-30 01:33:11,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:33:11,813 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash -251837041, now seen corresponding path program 10 times [2020-11-30 01:33:11,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:11,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236220789] [2020-11-30 01:33:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:12,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236220789] [2020-11-30 01:33:12,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:12,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:12,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683034460] [2020-11-30 01:33:12,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:12,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:12,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:12,476 INFO L87 Difference]: Start difference. First operand 247 states and 495 transitions. Second operand 14 states. [2020-11-30 01:33:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:13,308 INFO L93 Difference]: Finished difference Result 305 states and 600 transitions. [2020-11-30 01:33:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:13,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:13,310 INFO L225 Difference]: With dead ends: 305 [2020-11-30 01:33:13,310 INFO L226 Difference]: Without dead ends: 276 [2020-11-30 01:33:13,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-30 01:33:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 251. [2020-11-30 01:33:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-30 01:33:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 501 transitions. [2020-11-30 01:33:13,318 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 501 transitions. Word has length 22 [2020-11-30 01:33:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:13,318 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 501 transitions. [2020-11-30 01:33:13,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 501 transitions. [2020-11-30 01:33:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:13,319 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:13,319 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-11-30 01:33:13,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:33:13,319 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash 754971535, now seen corresponding path program 11 times [2020-11-30 01:33:13,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:13,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249064697] [2020-11-30 01:33:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249064697] [2020-11-30 01:33:14,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:14,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:14,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94893280] [2020-11-30 01:33:14,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:14,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:14,134 INFO L87 Difference]: Start difference. First operand 251 states and 501 transitions. Second operand 14 states. [2020-11-30 01:33:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:15,254 INFO L93 Difference]: Finished difference Result 296 states and 580 transitions. [2020-11-30 01:33:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:33:15,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:15,255 INFO L225 Difference]: With dead ends: 296 [2020-11-30 01:33:15,255 INFO L226 Difference]: Without dead ends: 279 [2020-11-30 01:33:15,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-30 01:33:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2020-11-30 01:33:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-11-30 01:33:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 507 transitions. [2020-11-30 01:33:15,263 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 507 transitions. Word has length 22 [2020-11-30 01:33:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:15,263 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 507 transitions. [2020-11-30 01:33:15,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 507 transitions. [2020-11-30 01:33:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:15,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:15,264 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-11-30 01:33:15,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:33:15,265 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -646170225, now seen corresponding path program 12 times [2020-11-30 01:33:15,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:15,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131572312] [2020-11-30 01:33:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:15,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131572312] [2020-11-30 01:33:15,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:15,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:15,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953228601] [2020-11-30 01:33:15,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:15,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:15,849 INFO L87 Difference]: Start difference. First operand 255 states and 507 transitions. Second operand 14 states. [2020-11-30 01:33:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:16,524 INFO L93 Difference]: Finished difference Result 285 states and 560 transitions. [2020-11-30 01:33:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:16,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:16,526 INFO L225 Difference]: With dead ends: 285 [2020-11-30 01:33:16,526 INFO L226 Difference]: Without dead ends: 260 [2020-11-30 01:33:16,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-30 01:33:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 241. [2020-11-30 01:33:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-30 01:33:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 485 transitions. [2020-11-30 01:33:16,534 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 485 transitions. Word has length 22 [2020-11-30 01:33:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:16,535 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 485 transitions. [2020-11-30 01:33:16,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 485 transitions. [2020-11-30 01:33:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:16,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:16,536 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-11-30 01:33:16,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:33:16,536 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1326801883, now seen corresponding path program 13 times [2020-11-30 01:33:16,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:16,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758097902] [2020-11-30 01:33:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:17,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758097902] [2020-11-30 01:33:17,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:17,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:17,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237759125] [2020-11-30 01:33:17,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:17,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:17,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:17,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:17,278 INFO L87 Difference]: Start difference. First operand 241 states and 485 transitions. Second operand 14 states. [2020-11-30 01:33:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:18,196 INFO L93 Difference]: Finished difference Result 351 states and 690 transitions. [2020-11-30 01:33:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:18,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:18,200 INFO L225 Difference]: With dead ends: 351 [2020-11-30 01:33:18,200 INFO L226 Difference]: Without dead ends: 324 [2020-11-30 01:33:18,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-30 01:33:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 242. [2020-11-30 01:33:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-30 01:33:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 486 transitions. [2020-11-30 01:33:18,208 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 486 transitions. Word has length 22 [2020-11-30 01:33:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:18,209 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 486 transitions. [2020-11-30 01:33:18,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 486 transitions. [2020-11-30 01:33:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:18,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:18,210 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-11-30 01:33:18,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:33:18,210 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:18,211 INFO L82 PathProgramCache]: Analyzing trace with hash -149804915, now seen corresponding path program 14 times [2020-11-30 01:33:18,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:18,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903407546] [2020-11-30 01:33:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:18,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903407546] [2020-11-30 01:33:18,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:18,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:18,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163175580] [2020-11-30 01:33:18,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:18,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:18,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:18,952 INFO L87 Difference]: Start difference. First operand 242 states and 486 transitions. Second operand 14 states. [2020-11-30 01:33:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:19,868 INFO L93 Difference]: Finished difference Result 343 states and 673 transitions. [2020-11-30 01:33:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:19,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:19,870 INFO L225 Difference]: With dead ends: 343 [2020-11-30 01:33:19,870 INFO L226 Difference]: Without dead ends: 314 [2020-11-30 01:33:19,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-11-30 01:33:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 246. [2020-11-30 01:33:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-30 01:33:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 492 transitions. [2020-11-30 01:33:19,879 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 492 transitions. Word has length 22 [2020-11-30 01:33:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:19,880 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 492 transitions. [2020-11-30 01:33:19,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 492 transitions. [2020-11-30 01:33:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:19,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:19,881 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-11-30 01:33:19,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:33:19,881 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash 857003661, now seen corresponding path program 15 times [2020-11-30 01:33:19,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:19,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193800294] [2020-11-30 01:33:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:20,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193800294] [2020-11-30 01:33:20,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:20,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:20,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087271530] [2020-11-30 01:33:20,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:20,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:20,837 INFO L87 Difference]: Start difference. First operand 246 states and 492 transitions. Second operand 14 states. [2020-11-30 01:33:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:21,742 INFO L93 Difference]: Finished difference Result 334 states and 653 transitions. [2020-11-30 01:33:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:33:21,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:21,745 INFO L225 Difference]: With dead ends: 334 [2020-11-30 01:33:21,745 INFO L226 Difference]: Without dead ends: 317 [2020-11-30 01:33:21,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-11-30 01:33:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2020-11-30 01:33:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-30 01:33:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 498 transitions. [2020-11-30 01:33:21,753 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 498 transitions. Word has length 22 [2020-11-30 01:33:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:21,753 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 498 transitions. [2020-11-30 01:33:21,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 498 transitions. [2020-11-30 01:33:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:21,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:21,754 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-11-30 01:33:21,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:33:21,755 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -544138099, now seen corresponding path program 16 times [2020-11-30 01:33:21,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:21,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800485393] [2020-11-30 01:33:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:22,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800485393] [2020-11-30 01:33:22,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:22,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:22,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834366336] [2020-11-30 01:33:22,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:22,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:22,670 INFO L87 Difference]: Start difference. First operand 250 states and 498 transitions. Second operand 14 states. [2020-11-30 01:33:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:23,594 INFO L93 Difference]: Finished difference Result 323 states and 633 transitions. [2020-11-30 01:33:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:23,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:23,596 INFO L225 Difference]: With dead ends: 323 [2020-11-30 01:33:23,596 INFO L226 Difference]: Without dead ends: 290 [2020-11-30 01:33:23,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-30 01:33:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 228. [2020-11-30 01:33:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-11-30 01:33:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 463 transitions. [2020-11-30 01:33:23,604 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 463 transitions. Word has length 22 [2020-11-30 01:33:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:23,604 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 463 transitions. [2020-11-30 01:33:23,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 463 transitions. [2020-11-30 01:33:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:23,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:23,605 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-11-30 01:33:23,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:33:23,605 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash -618210351, now seen corresponding path program 17 times [2020-11-30 01:33:23,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:23,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031574529] [2020-11-30 01:33:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:23,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031574529] [2020-11-30 01:33:23,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:23,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:33:23,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355217150] [2020-11-30 01:33:23,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:33:23,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:33:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:33:23,769 INFO L87 Difference]: Start difference. First operand 228 states and 463 transitions. Second operand 6 states. [2020-11-30 01:33:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:23,866 INFO L93 Difference]: Finished difference Result 128 states and 203 transitions. [2020-11-30 01:33:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:33:23,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-30 01:33:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:23,868 INFO L225 Difference]: With dead ends: 128 [2020-11-30 01:33:23,868 INFO L226 Difference]: Without dead ends: 128 [2020-11-30 01:33:23,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:33:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-30 01:33:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-11-30 01:33:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-30 01:33:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2020-11-30 01:33:23,871 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 22 [2020-11-30 01:33:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:23,872 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2020-11-30 01:33:23,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:33:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2020-11-30 01:33:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:23,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:23,872 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-11-30 01:33:23,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:33:23,873 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1321574743, now seen corresponding path program 18 times [2020-11-30 01:33:23,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:23,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583544537] [2020-11-30 01:33:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:24,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583544537] [2020-11-30 01:33:24,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:24,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:24,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938730425] [2020-11-30 01:33:24,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:24,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:24,602 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand 14 states. [2020-11-30 01:33:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:25,338 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2020-11-30 01:33:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:25,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:25,339 INFO L225 Difference]: With dead ends: 159 [2020-11-30 01:33:25,339 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 01:33:25,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 01:33:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2020-11-30 01:33:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-30 01:33:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2020-11-30 01:33:25,342 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 22 [2020-11-30 01:33:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:25,342 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2020-11-30 01:33:25,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2020-11-30 01:33:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:25,343 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:25,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:33:25,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 01:33:25,343 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1537379531, now seen corresponding path program 19 times [2020-11-30 01:33:25,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:25,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100791838] [2020-11-30 01:33:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:26,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100791838] [2020-11-30 01:33:26,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:26,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:26,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213435901] [2020-11-30 01:33:26,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:26,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:26,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:26,048 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand 14 states. [2020-11-30 01:33:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:26,813 INFO L93 Difference]: Finished difference Result 156 states and 243 transitions. [2020-11-30 01:33:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:26,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:26,814 INFO L225 Difference]: With dead ends: 156 [2020-11-30 01:33:26,814 INFO L226 Difference]: Without dead ends: 128 [2020-11-30 01:33:26,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-30 01:33:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-11-30 01:33:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-30 01:33:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2020-11-30 01:33:26,818 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 22 [2020-11-30 01:33:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:26,818 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2020-11-30 01:33:26,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2020-11-30 01:33:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:26,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:26,819 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-11-30 01:33:26,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 01:33:26,820 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash -98538729, now seen corresponding path program 20 times [2020-11-30 01:33:26,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:26,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021075013] [2020-11-30 01:33:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:27,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021075013] [2020-11-30 01:33:27,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:27,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:27,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440497316] [2020-11-30 01:33:27,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:27,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:27,675 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand 14 states. [2020-11-30 01:33:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:28,575 INFO L93 Difference]: Finished difference Result 167 states and 262 transitions. [2020-11-30 01:33:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:28,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:28,576 INFO L225 Difference]: With dead ends: 167 [2020-11-30 01:33:28,577 INFO L226 Difference]: Without dead ends: 140 [2020-11-30 01:33:28,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-30 01:33:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2020-11-30 01:33:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-30 01:33:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2020-11-30 01:33:28,580 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 22 [2020-11-30 01:33:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:28,581 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2020-11-30 01:33:28,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2020-11-30 01:33:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:28,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:28,582 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-11-30 01:33:28,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 01:33:28,582 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1078458239, now seen corresponding path program 21 times [2020-11-30 01:33:28,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:28,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647843037] [2020-11-30 01:33:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:29,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647843037] [2020-11-30 01:33:29,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:29,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:29,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082925895] [2020-11-30 01:33:29,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:29,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:29,251 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand 14 states. [2020-11-30 01:33:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:30,006 INFO L93 Difference]: Finished difference Result 159 states and 245 transitions. [2020-11-30 01:33:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:30,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:30,008 INFO L225 Difference]: With dead ends: 159 [2020-11-30 01:33:30,008 INFO L226 Difference]: Without dead ends: 130 [2020-11-30 01:33:30,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-30 01:33:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2020-11-30 01:33:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-30 01:33:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2020-11-30 01:33:30,012 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 22 [2020-11-30 01:33:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:30,013 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2020-11-30 01:33:30,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2020-11-30 01:33:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:30,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:30,014 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-11-30 01:33:30,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:33:30,014 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2085266815, now seen corresponding path program 22 times [2020-11-30 01:33:30,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:30,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591659972] [2020-11-30 01:33:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:30,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591659972] [2020-11-30 01:33:30,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:30,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:30,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36460233] [2020-11-30 01:33:30,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:30,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:30,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:30,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:30,629 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand 14 states. [2020-11-30 01:33:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:31,425 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2020-11-30 01:33:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:33:31,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:31,427 INFO L225 Difference]: With dead ends: 151 [2020-11-30 01:33:31,427 INFO L226 Difference]: Without dead ends: 134 [2020-11-30 01:33:31,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-30 01:33:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2020-11-30 01:33:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-30 01:33:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2020-11-30 01:33:31,433 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 22 [2020-11-30 01:33:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:31,433 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2020-11-30 01:33:31,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2020-11-30 01:33:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:31,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:31,434 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-11-30 01:33:31,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-30 01:33:31,435 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 684125055, now seen corresponding path program 23 times [2020-11-30 01:33:31,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:31,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356007032] [2020-11-30 01:33:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:32,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356007032] [2020-11-30 01:33:32,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:32,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:32,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944442439] [2020-11-30 01:33:32,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:32,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:32,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:32,263 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand 14 states. [2020-11-30 01:33:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:32,835 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2020-11-30 01:33:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:32,836 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:32,836 INFO L225 Difference]: With dead ends: 139 [2020-11-30 01:33:32,836 INFO L226 Difference]: Without dead ends: 110 [2020-11-30 01:33:32,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-30 01:33:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-11-30 01:33:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-30 01:33:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2020-11-30 01:33:32,840 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 22 [2020-11-30 01:33:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:32,840 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2020-11-30 01:33:32,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2020-11-30 01:33:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:32,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:32,840 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-11-30 01:33:32,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 01:33:32,841 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 374516555, now seen corresponding path program 24 times [2020-11-30 01:33:32,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:32,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146596843] [2020-11-30 01:33:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:33,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146596843] [2020-11-30 01:33:33,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:33,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:33,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675490631] [2020-11-30 01:33:33,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:33,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:33,564 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 14 states. [2020-11-30 01:33:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:34,270 INFO L93 Difference]: Finished difference Result 101 states and 151 transitions. [2020-11-30 01:33:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:34,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:34,271 INFO L225 Difference]: With dead ends: 101 [2020-11-30 01:33:34,271 INFO L226 Difference]: Without dead ends: 71 [2020-11-30 01:33:34,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-30 01:33:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-11-30 01:33:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 01:33:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2020-11-30 01:33:34,274 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 22 [2020-11-30 01:33:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:34,274 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2020-11-30 01:33:34,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2020-11-30 01:33:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:34,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:34,274 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-11-30 01:33:34,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 01:33:34,274 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash -983508743, now seen corresponding path program 25 times [2020-11-30 01:33:34,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:34,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551977367] [2020-11-30 01:33:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:34,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551977367] [2020-11-30 01:33:34,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:34,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:34,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085708770] [2020-11-30 01:33:34,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:34,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:34,848 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 14 states. [2020-11-30 01:33:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:35,535 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2020-11-30 01:33:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:35,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:35,536 INFO L225 Difference]: With dead ends: 87 [2020-11-30 01:33:35,536 INFO L226 Difference]: Without dead ends: 87 [2020-11-30 01:33:35,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-30 01:33:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2020-11-30 01:33:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:33:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2020-11-30 01:33:35,539 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 22 [2020-11-30 01:33:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:35,540 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2020-11-30 01:33:35,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2020-11-30 01:33:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:35,540 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:35,540 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-11-30 01:33:35,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:33:35,540 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -983508788, now seen corresponding path program 3 times [2020-11-30 01:33:35,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:35,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146931699] [2020-11-30 01:33:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:35,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146931699] [2020-11-30 01:33:35,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:35,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:33:35,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420728955] [2020-11-30 01:33:35,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:33:35,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:33:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:33:35,861 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 9 states. [2020-11-30 01:33:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:36,169 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2020-11-30 01:33:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:33:36,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-30 01:33:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:36,187 INFO L225 Difference]: With dead ends: 111 [2020-11-30 01:33:36,187 INFO L226 Difference]: Without dead ends: 95 [2020-11-30 01:33:36,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-30 01:33:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-30 01:33:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:33:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2020-11-30 01:33:36,190 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 22 [2020-11-30 01:33:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:36,190 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2020-11-30 01:33:36,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:33:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2020-11-30 01:33:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:36,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:36,191 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-11-30 01:33:36,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 01:33:36,191 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1609619909, now seen corresponding path program 26 times [2020-11-30 01:33:36,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:36,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328919275] [2020-11-30 01:33:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:36,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328919275] [2020-11-30 01:33:36,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:36,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:36,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613064898] [2020-11-30 01:33:36,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:36,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:36,820 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand 14 states. [2020-11-30 01:33:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:37,554 INFO L93 Difference]: Finished difference Result 126 states and 188 transitions. [2020-11-30 01:33:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:37,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:37,555 INFO L225 Difference]: With dead ends: 126 [2020-11-30 01:33:37,555 INFO L226 Difference]: Without dead ends: 84 [2020-11-30 01:33:37,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-30 01:33:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-30 01:33:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:33:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2020-11-30 01:33:37,557 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 22 [2020-11-30 01:33:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:37,557 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2020-11-30 01:33:37,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2020-11-30 01:33:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:37,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:37,558 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-11-30 01:33:37,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 01:33:37,558 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:37,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 468200473, now seen corresponding path program 2 times [2020-11-30 01:33:37,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:37,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805532656] [2020-11-30 01:33:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:37,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805532656] [2020-11-30 01:33:37,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:37,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:33:37,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141815117] [2020-11-30 01:33:37,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:33:37,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:33:37,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:33:37,680 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand 8 states. [2020-11-30 01:33:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:37,913 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2020-11-30 01:33:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:33:37,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-30 01:33:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:37,914 INFO L225 Difference]: With dead ends: 69 [2020-11-30 01:33:37,914 INFO L226 Difference]: Without dead ends: 69 [2020-11-30 01:33:37,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:33:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-30 01:33:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-11-30 01:33:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 01:33:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2020-11-30 01:33:37,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 22 [2020-11-30 01:33:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:37,916 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2020-11-30 01:33:37,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:33:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2020-11-30 01:33:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:37,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:37,917 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-11-30 01:33:37,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 01:33:37,917 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash -411053783, now seen corresponding path program 27 times [2020-11-30 01:33:37,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:37,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870058617] [2020-11-30 01:33:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:38,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870058617] [2020-11-30 01:33:38,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:38,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:38,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046000119] [2020-11-30 01:33:38,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:38,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:38,635 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 14 states. [2020-11-30 01:33:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:39,511 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2020-11-30 01:33:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:33:39,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:39,517 INFO L225 Difference]: With dead ends: 79 [2020-11-30 01:33:39,517 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 01:33:39,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 01:33:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-11-30 01:33:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-30 01:33:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-11-30 01:33:39,520 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2020-11-30 01:33:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:39,520 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-11-30 01:33:39,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-11-30 01:33:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:39,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:39,521 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-11-30 01:33:39,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 01:33:39,521 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:39,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2098826979, now seen corresponding path program 28 times [2020-11-30 01:33:39,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:39,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009095006] [2020-11-30 01:33:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:40,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-11-30 01:33:40,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009095006] [2020-11-30 01:33:40,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:40,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:40,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546974104] [2020-11-30 01:33:40,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:40,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:40,365 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 14 states. [2020-11-30 01:33:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:41,079 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-11-30 01:33:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:41,079 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:41,080 INFO L225 Difference]: With dead ends: 66 [2020-11-30 01:33:41,080 INFO L226 Difference]: Without dead ends: 54 [2020-11-30 01:33:41,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:33:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-30 01:33:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-30 01:33:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 01:33:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-11-30 01:33:41,082 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 22 [2020-11-30 01:33:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:41,082 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-11-30 01:33:41,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-11-30 01:33:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:41,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:41,082 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-11-30 01:33:41,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-30 01:33:41,083 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468309, now seen corresponding path program 29 times [2020-11-30 01:33:41,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:41,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25059874] [2020-11-30 01:33:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:41,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25059874] [2020-11-30 01:33:41,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:41,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:41,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131638494] [2020-11-30 01:33:41,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:41,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:41,700 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 14 states. [2020-11-30 01:33:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:42,299 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2020-11-30 01:33:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:42,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:42,300 INFO L225 Difference]: With dead ends: 72 [2020-11-30 01:33:42,300 INFO L226 Difference]: Without dead ends: 72 [2020-11-30 01:33:42,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-30 01:33:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-11-30 01:33:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 01:33:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2020-11-30 01:33:42,302 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 22 [2020-11-30 01:33:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:42,302 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2020-11-30 01:33:42,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2020-11-30 01:33:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:42,302 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:42,302 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-11-30 01:33:42,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-30 01:33:42,303 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:42,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1088468264, now seen corresponding path program 4 times [2020-11-30 01:33:42,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:42,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43857926] [2020-11-30 01:33:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:42,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43857926] [2020-11-30 01:33:42,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:42,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:33:42,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564551354] [2020-11-30 01:33:42,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:33:42,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:33:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:33:42,628 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 9 states. [2020-11-30 01:33:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:42,841 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2020-11-30 01:33:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:33:42,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-30 01:33:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:42,841 INFO L225 Difference]: With dead ends: 70 [2020-11-30 01:33:42,842 INFO L226 Difference]: Without dead ends: 44 [2020-11-30 01:33:42,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-30 01:33:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-30 01:33:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-30 01:33:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2020-11-30 01:33:42,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2020-11-30 01:33:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:42,843 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2020-11-30 01:33:42,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:33:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2020-11-30 01:33:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:42,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:42,844 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-11-30 01:33:42,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-30 01:33:42,844 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 22133125, now seen corresponding path program 3 times [2020-11-30 01:33:42,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:42,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425076906] [2020-11-30 01:33:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:43,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425076906] [2020-11-30 01:33:43,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:43,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:43,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793681229] [2020-11-30 01:33:43,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:33:43,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:43,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:33:43,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:33:43,117 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 13 states. [2020-11-30 01:33:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:43,462 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2020-11-30 01:33:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:33:43,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-11-30 01:33:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:43,463 INFO L225 Difference]: With dead ends: 44 [2020-11-30 01:33:43,463 INFO L226 Difference]: Without dead ends: 35 [2020-11-30 01:33:43,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:33:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-30 01:33:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-30 01:33:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-30 01:33:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-11-30 01:33:43,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2020-11-30 01:33:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:43,465 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-11-30 01:33:43,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:33:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-11-30 01:33:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:43,465 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:43,465 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-11-30 01:33:43,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-30 01:33:43,466 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash 913881587, now seen corresponding path program 30 times [2020-11-30 01:33:43,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:43,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973760921] [2020-11-30 01:33:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:44,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973760921] [2020-11-30 01:33:44,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:44,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:44,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900900286] [2020-11-30 01:33:44,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:44,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:44,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:44,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:44,239 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 14 states. [2020-11-30 01:33:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:44,938 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-11-30 01:33:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:33:44,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:44,939 INFO L225 Difference]: With dead ends: 42 [2020-11-30 01:33:44,939 INFO L226 Difference]: Without dead ends: 34 [2020-11-30 01:33:44,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-30 01:33:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-30 01:33:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-30 01:33:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-11-30 01:33:44,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2020-11-30 01:33:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:44,941 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-11-30 01:33:44,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-11-30 01:33:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:33:44,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:44,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, 1, 1] [2020-11-30 01:33:44,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-30 01:33:44,942 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -92005337, now seen corresponding path program 31 times [2020-11-30 01:33:44,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:33:44,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100836209] [2020-11-30 01:33:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:33:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:33:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:33:46,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100836209] [2020-11-30 01:33:46,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:33:46,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:33:46,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689951762] [2020-11-30 01:33:46,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:33:46,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:33:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:33:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:33:46,012 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 14 states. [2020-11-30 01:33:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:46,574 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-11-30 01:33:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:33:46,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-11-30 01:33:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:46,575 INFO L225 Difference]: With dead ends: 33 [2020-11-30 01:33:46,575 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 01:33:46,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:33:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 01:33:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 01:33:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 01:33:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 01:33:46,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-11-30 01:33:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:46,576 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:33:46,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:33:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 01:33:46,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 01:33:46,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-30 01:33:46,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:33:46 BasicIcfg [2020-11-30 01:33:46,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:33:46,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:33:46,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:33:46,579 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:33:46,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:32:20" (3/4) ... [2020-11-30 01:33:46,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 01:33:46,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2020-11-30 01:33:46,606 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2020-11-30 01:33:46,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-30 01:33:46,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 01:33:46,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 01:33:46,662 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_378b90d0-1048-4797-b064-900f5149fe26/bin/uautomizer/witness.graphml [2020-11-30 01:33:46,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:33:46,664 INFO L168 Benchmark]: Toolchain (without parser) took 89087.55 ms. Allocated memory was 90.2 MB in the beginning and 308.3 MB in the end (delta: 218.1 MB). Free memory was 58.0 MB in the beginning and 233.4 MB in the end (delta: -175.4 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,664 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 90.2 MB. Free memory was 49.2 MB in the beginning and 49.2 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:33:46,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1924.65 ms. Allocated memory was 90.2 MB in the beginning and 121.6 MB in the end (delta: 31.5 MB). Free memory was 57.8 MB in the beginning and 79.5 MB in the end (delta: -21.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.06 ms. Allocated memory is still 121.6 MB. Free memory was 79.5 MB in the beginning and 76.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,665 INFO L168 Benchmark]: Boogie Preprocessor took 105.19 ms. Allocated memory is still 121.6 MB. Free memory was 76.4 MB in the beginning and 74.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,666 INFO L168 Benchmark]: RCFGBuilder took 1075.01 ms. Allocated memory is still 121.6 MB. Free memory was 74.3 MB in the beginning and 81.4 MB in the end (delta: -7.1 MB). Peak memory consumption was 40.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,666 INFO L168 Benchmark]: TraceAbstraction took 85739.61 ms. Allocated memory was 121.6 MB in the beginning and 308.3 MB in the end (delta: 186.6 MB). Free memory was 80.3 MB in the beginning and 237.6 MB in the end (delta: -157.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,667 INFO L168 Benchmark]: Witness Printer took 83.70 ms. Allocated memory is still 308.3 MB. Free memory was 237.6 MB in the beginning and 233.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:33:46,669 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.28 ms. Allocated memory is still 90.2 MB. Free memory was 49.2 MB in the beginning and 49.2 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1924.65 ms. Allocated memory was 90.2 MB in the beginning and 121.6 MB in the end (delta: 31.5 MB). Free memory was 57.8 MB in the beginning and 79.5 MB in the end (delta: -21.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 137.06 ms. Allocated memory is still 121.6 MB. Free memory was 79.5 MB in the beginning and 76.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 105.19 ms. Allocated memory is still 121.6 MB. Free memory was 76.4 MB in the beginning and 74.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1075.01 ms. Allocated memory is still 121.6 MB. Free memory was 74.3 MB in the beginning and 81.4 MB in the end (delta: -7.1 MB). Peak memory consumption was 40.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 85739.61 ms. Allocated memory was 121.6 MB in the beginning and 308.3 MB in the end (delta: 186.6 MB). Free memory was 80.3 MB in the beginning and 237.6 MB in the end (delta: -157.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Witness Printer took 83.70 ms. Allocated memory is still 308.3 MB. Free memory was 237.6 MB in the beginning and 233.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2408 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 8 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 18.0s, 155 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 30.7s, 179 PlacesBefore, 41 PlacesAfterwards, 189 TransitionsBefore, 40 TransitionsAfterwards, 3444 CoEnabledTransitionPairs, 8 FixpointIterations, 116 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 237 TotalNumberOfCompositions, 7933 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 85.5s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.8s, HoareTripleCheckerStatistics: 1035 SDtfs, 1801 SDslu, 4544 SDs, 0 SdLazy, 11406 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 26 SyntacticMatches, 70 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 33.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 42 MinimizatonAttempts, 758 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 382053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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 correct! Received shutdown request...