./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c --full-output -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3becc2ba0b7e983991bfd65eb00af941bbea5c1f -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 22:39:51,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 22:39:51,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 22:39:51,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 22:39:51,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 22:39:51,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 22:39:51,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 22:39:51,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 22:39:51,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 22:39:51,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 22:39:51,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 22:39:51,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 22:39:51,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 22:39:51,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 22:39:51,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 22:39:51,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 22:39:51,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 22:39:51,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 22:39:51,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 22:39:51,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 22:39:51,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 22:39:51,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 22:39:51,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 22:39:51,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 22:39:51,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 22:39:51,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 22:39:51,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 22:39:51,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 22:39:51,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 22:39:51,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 22:39:51,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 22:39:51,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 22:39:51,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 22:39:51,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 22:39:51,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 22:39:51,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 22:39:51,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 22:39:51,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 22:39:51,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 22:39:51,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 22:39:51,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 22:39:51,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 22:39:51,736 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 22:39:51,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 22:39:51,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 22:39:51,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 22:39:51,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 22:39:51,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 22:39:51,739 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 22:39:51,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 22:39:51,740 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 22:39:51,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 22:39:51,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 22:39:51,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 22:39:51,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 22:39:51,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 22:39:51,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 22:39:51,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 22:39:51,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 22:39:51,742 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 22:39:51,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 22:39:51,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 22:39:51,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 22:39:51,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 22:39:51,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:39:51,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 22:39:51,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 22:39:51,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 22:39:51,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 22:39:51,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 22:39:51,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 22:39:51,745 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 22:39:51,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3becc2ba0b7e983991bfd65eb00af941bbea5c1f [2021-10-05 22:39:52,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 22:39:52,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 22:39:52,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 22:39:52,130 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 22:39:52,131 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 22:39:52,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-05 22:39:52,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6240bd307/0a52cdae22614e848e98a501289d1cf8/FLAG788f54e88 [2021-10-05 22:39:52,895 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 22:39:52,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-05 22:39:52,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6240bd307/0a52cdae22614e848e98a501289d1cf8/FLAG788f54e88 [2021-10-05 22:39:53,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6240bd307/0a52cdae22614e848e98a501289d1cf8 [2021-10-05 22:39:53,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 22:39:53,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 22:39:53,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 22:39:53,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 22:39:53,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 22:39:53,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27232f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53, skipping insertion in model container [2021-10-05 22:39:53,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 22:39:53,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 22:39:53,490 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[2507,2520] [2021-10-05 22:39:53,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:39:53,511 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 22:39:53,535 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[2507,2520] [2021-10-05 22:39:53,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:39:53,553 INFO L208 MainTranslator]: Completed translation [2021-10-05 22:39:53,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53 WrapperNode [2021-10-05 22:39:53,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 22:39:53,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 22:39:53,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 22:39:53,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 22:39:53,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 22:39:53,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 22:39:53,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 22:39:53,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 22:39:53,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 22:39:53,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 22:39:53,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 22:39:53,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 22:39:53,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (1/1) ... [2021-10-05 22:39:53,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:39:53,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 22:39:53,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 22:39:53,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 22:39:53,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 22:39:53,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 22:39:53,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 22:39:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 22:39:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 22:39:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 22:39:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 22:39:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 22:39:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 22:39:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-05 22:39:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-05 22:39:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 22:39:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 22:39:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 22:39:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 22:39:53,754 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 22:39:54,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 22:39:54,233 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-05 22:39:54,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:39:54 BoogieIcfgContainer [2021-10-05 22:39:54,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 22:39:54,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 22:39:54,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 22:39:54,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 22:39:54,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:39:53" (1/3) ... [2021-10-05 22:39:54,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dedfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:39:54, skipping insertion in model container [2021-10-05 22:39:54,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:53" (2/3) ... [2021-10-05 22:39:54,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dedfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:39:54, skipping insertion in model container [2021-10-05 22:39:54,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:39:54" (3/3) ... [2021-10-05 22:39:54,248 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-3.wvr.c [2021-10-05 22:39:54,259 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 22:39:54,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 22:39:54,261 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 22:39:54,261 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 22:39:54,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,327 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,328 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,328 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,328 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,329 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,329 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,329 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,329 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,330 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,330 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,330 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,331 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,331 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,331 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,332 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,332 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,332 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,334 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,335 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,336 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,336 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,336 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,343 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,348 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,349 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,349 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,350 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,351 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,351 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,351 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,352 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,352 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,357 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,361 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,362 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,362 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,363 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,363 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,363 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,366 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,368 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,374 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,375 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,375 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,375 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,376 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,376 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:39:54,388 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 22:39:54,450 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 22:39:54,458 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 22:39:54,459 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 22:39:54,480 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 22:39:54,493 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 129 transitions, 282 flow [2021-10-05 22:39:54,496 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 129 transitions, 282 flow [2021-10-05 22:39:54,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 282 flow [2021-10-05 22:39:54,580 INFO L129 PetriNetUnfolder]: 5/126 cut-off events. [2021-10-05 22:39:54,581 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 22:39:54,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 5/126 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-10-05 22:39:54,591 INFO L116 LiptonReduction]: Number of co-enabled transitions 2032 [2021-10-05 22:39:59,557 INFO L131 LiptonReduction]: Checked pairs total: 6175 [2021-10-05 22:39:59,558 INFO L133 LiptonReduction]: Total number of compositions: 119 [2021-10-05 22:39:59,568 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 36 transitions, 96 flow [2021-10-05 22:39:59,632 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:39:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:39:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-05 22:39:59,662 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:39:59,662 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:39:59,663 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:39:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:39:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1880696020, now seen corresponding path program 1 times [2021-10-05 22:39:59,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:39:59,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705738540] [2021-10-05 22:39:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:39:59,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:39:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:39:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:39:59,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:39:59,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705738540] [2021-10-05 22:39:59,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705738540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:39:59,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:39:59,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 22:39:59,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448195579] [2021-10-05 22:39:59,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 22:39:59,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:39:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 22:39:59,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 22:39:59,901 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 3.3207547169811322) internal successors, (2288), 689 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:39:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:39:59,948 INFO L93 Difference]: Finished difference Result 690 states and 1994 transitions. [2021-10-05 22:39:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 22:39:59,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-05 22:39:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:39:59,993 INFO L225 Difference]: With dead ends: 690 [2021-10-05 22:39:59,994 INFO L226 Difference]: Without dead ends: 690 [2021-10-05 22:39:59,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 22:40:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-05 22:40:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-10-05 22:40:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.8940493468795356) internal successors, (1994), 689 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1994 transitions. [2021-10-05 22:40:00,141 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1994 transitions. Word has length 16 [2021-10-05 22:40:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:00,142 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1994 transitions. [2021-10-05 22:40:00,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1994 transitions. [2021-10-05 22:40:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:00,153 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:00,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:00,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 22:40:00,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1958890216, now seen corresponding path program 1 times [2021-10-05 22:40:00,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:00,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816273955] [2021-10-05 22:40:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:00,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:00,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:00,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816273955] [2021-10-05 22:40:00,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816273955] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:00,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:00,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:40:00,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841546269] [2021-10-05 22:40:00,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:40:00,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:40:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:00,654 INFO L87 Difference]: Start difference. First operand 690 states and 1994 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:01,107 INFO L93 Difference]: Finished difference Result 1536 states and 4385 transitions. [2021-10-05 22:40:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:40:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:01,115 INFO L225 Difference]: With dead ends: 1536 [2021-10-05 22:40:01,115 INFO L226 Difference]: Without dead ends: 754 [2021-10-05 22:40:01,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 220.9ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:40:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-10-05 22:40:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 582. [2021-10-05 22:40:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.7263339070567985) internal successors, (1584), 581 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1584 transitions. [2021-10-05 22:40:01,163 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1584 transitions. Word has length 29 [2021-10-05 22:40:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:01,163 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 1584 transitions. [2021-10-05 22:40:01,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1584 transitions. [2021-10-05 22:40:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:01,167 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:01,167 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:01,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 22:40:01,168 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1777587464, now seen corresponding path program 2 times [2021-10-05 22:40:01,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:01,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055342528] [2021-10-05 22:40:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:01,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:01,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:01,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055342528] [2021-10-05 22:40:01,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055342528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:01,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:01,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:40:01,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531929645] [2021-10-05 22:40:01,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:40:01,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:01,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:40:01,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:40:01,374 INFO L87 Difference]: Start difference. First operand 582 states and 1584 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:01,596 INFO L93 Difference]: Finished difference Result 828 states and 2244 transitions. [2021-10-05 22:40:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:01,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:01,602 INFO L225 Difference]: With dead ends: 828 [2021-10-05 22:40:01,603 INFO L226 Difference]: Without dead ends: 710 [2021-10-05 22:40:01,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-05 22:40:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 638. [2021-10-05 22:40:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.682888540031397) internal successors, (1709), 637 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1709 transitions. [2021-10-05 22:40:01,630 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1709 transitions. Word has length 29 [2021-10-05 22:40:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:01,630 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 1709 transitions. [2021-10-05 22:40:01,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1709 transitions. [2021-10-05 22:40:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:01,634 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:01,634 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 22:40:01,635 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1688701780, now seen corresponding path program 3 times [2021-10-05 22:40:01,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:01,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362092814] [2021-10-05 22:40:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:01,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:01,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:01,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362092814] [2021-10-05 22:40:01,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362092814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:01,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:01,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:40:01,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634895730] [2021-10-05 22:40:01,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:40:01,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:40:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:01,891 INFO L87 Difference]: Start difference. First operand 638 states and 1709 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:02,149 INFO L93 Difference]: Finished difference Result 820 states and 2164 transitions. [2021-10-05 22:40:02,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:02,156 INFO L225 Difference]: With dead ends: 820 [2021-10-05 22:40:02,156 INFO L226 Difference]: Without dead ends: 734 [2021-10-05 22:40:02,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:40:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-05 22:40:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 662. [2021-10-05 22:40:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 2.6565809379727687) internal successors, (1756), 661 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1756 transitions. [2021-10-05 22:40:02,184 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1756 transitions. Word has length 29 [2021-10-05 22:40:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:02,185 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 1756 transitions. [2021-10-05 22:40:02,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1756 transitions. [2021-10-05 22:40:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:02,188 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:02,188 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:02,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 22:40:02,189 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash -695288994, now seen corresponding path program 4 times [2021-10-05 22:40:02,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:02,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595463623] [2021-10-05 22:40:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:02,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:02,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:02,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595463623] [2021-10-05 22:40:02,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595463623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:02,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:02,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:02,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755280726] [2021-10-05 22:40:02,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:02,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:02,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:02,435 INFO L87 Difference]: Start difference. First operand 662 states and 1756 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:02,819 INFO L93 Difference]: Finished difference Result 872 states and 2234 transitions. [2021-10-05 22:40:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:40:02,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:02,826 INFO L225 Difference]: With dead ends: 872 [2021-10-05 22:40:02,827 INFO L226 Difference]: Without dead ends: 818 [2021-10-05 22:40:02,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 157.0ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:40:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-10-05 22:40:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 696. [2021-10-05 22:40:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.6158273381294963) internal successors, (1818), 695 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1818 transitions. [2021-10-05 22:40:02,855 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1818 transitions. Word has length 29 [2021-10-05 22:40:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:02,856 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1818 transitions. [2021-10-05 22:40:02,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1818 transitions. [2021-10-05 22:40:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:02,860 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:02,860 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:02,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 22:40:02,861 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash -815126900, now seen corresponding path program 5 times [2021-10-05 22:40:02,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:02,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120697914] [2021-10-05 22:40:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:02,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:02,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:02,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120697914] [2021-10-05 22:40:02,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120697914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:02,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:02,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:40:02,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564868515] [2021-10-05 22:40:02,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:40:02,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:40:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:40:02,979 INFO L87 Difference]: Start difference. First operand 696 states and 1818 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:03,157 INFO L93 Difference]: Finished difference Result 668 states and 1616 transitions. [2021-10-05 22:40:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:03,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:03,161 INFO L225 Difference]: With dead ends: 668 [2021-10-05 22:40:03,162 INFO L226 Difference]: Without dead ends: 554 [2021-10-05 22:40:03,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:40:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-10-05 22:40:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 518. [2021-10-05 22:40:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.4352030947775627) internal successors, (1259), 517 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1259 transitions. [2021-10-05 22:40:03,184 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1259 transitions. Word has length 29 [2021-10-05 22:40:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:03,184 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 1259 transitions. [2021-10-05 22:40:03,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1259 transitions. [2021-10-05 22:40:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:03,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:03,190 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:03,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 22:40:03,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1428910720, now seen corresponding path program 6 times [2021-10-05 22:40:03,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:03,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914353024] [2021-10-05 22:40:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:03,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:03,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:03,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914353024] [2021-10-05 22:40:03,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914353024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:03,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:03,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 22:40:03,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624589253] [2021-10-05 22:40:03,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 22:40:03,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:03,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 22:40:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:40:03,416 INFO L87 Difference]: Start difference. First operand 518 states and 1259 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:03,507 INFO L93 Difference]: Finished difference Result 386 states and 913 transitions. [2021-10-05 22:40:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-05 22:40:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:03,513 INFO L225 Difference]: With dead ends: 386 [2021-10-05 22:40:03,513 INFO L226 Difference]: Without dead ends: 386 [2021-10-05 22:40:03,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-10-05 22:40:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-10-05 22:40:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.3714285714285714) internal successors, (913), 385 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 913 transitions. [2021-10-05 22:40:03,528 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 913 transitions. Word has length 29 [2021-10-05 22:40:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:03,529 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 913 transitions. [2021-10-05 22:40:03,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 913 transitions. [2021-10-05 22:40:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:03,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:03,533 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:03,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 22:40:03,533 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash -385049362, now seen corresponding path program 7 times [2021-10-05 22:40:03,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:03,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798348662] [2021-10-05 22:40:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:03,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:03,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:03,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798348662] [2021-10-05 22:40:03,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798348662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:03,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:03,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 22:40:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339926016] [2021-10-05 22:40:03,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 22:40:03,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 22:40:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:40:03,732 INFO L87 Difference]: Start difference. First operand 386 states and 913 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:03,832 INFO L93 Difference]: Finished difference Result 394 states and 922 transitions. [2021-10-05 22:40:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-05 22:40:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:03,835 INFO L225 Difference]: With dead ends: 394 [2021-10-05 22:40:03,836 INFO L226 Difference]: Without dead ends: 362 [2021-10-05 22:40:03,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:40:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-05 22:40:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-10-05 22:40:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.329639889196676) internal successors, (841), 361 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 841 transitions. [2021-10-05 22:40:03,848 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 841 transitions. Word has length 29 [2021-10-05 22:40:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:03,848 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 841 transitions. [2021-10-05 22:40:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 841 transitions. [2021-10-05 22:40:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:03,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:03,850 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:03,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 22:40:03,850 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1214339244, now seen corresponding path program 8 times [2021-10-05 22:40:03,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:03,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369870040] [2021-10-05 22:40:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:03,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:04,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:04,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369870040] [2021-10-05 22:40:04,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369870040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:04,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:04,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:04,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269900979] [2021-10-05 22:40:04,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:04,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:04,033 INFO L87 Difference]: Start difference. First operand 362 states and 841 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:04,279 INFO L93 Difference]: Finished difference Result 446 states and 1013 transitions. [2021-10-05 22:40:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:04,283 INFO L225 Difference]: With dead ends: 446 [2021-10-05 22:40:04,284 INFO L226 Difference]: Without dead ends: 422 [2021-10-05 22:40:04,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 109.7ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-05 22:40:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 366. [2021-10-05 22:40:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.317808219178082) internal successors, (846), 365 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 846 transitions. [2021-10-05 22:40:04,295 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 846 transitions. Word has length 29 [2021-10-05 22:40:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:04,296 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 846 transitions. [2021-10-05 22:40:04,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 846 transitions. [2021-10-05 22:40:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:04,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:04,298 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:04,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 22:40:04,298 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash 798537964, now seen corresponding path program 9 times [2021-10-05 22:40:04,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:04,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362439223] [2021-10-05 22:40:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:04,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:04,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:04,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362439223] [2021-10-05 22:40:04,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362439223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:04,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:04,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:04,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834794296] [2021-10-05 22:40:04,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:04,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:04,445 INFO L87 Difference]: Start difference. First operand 366 states and 846 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:04,657 INFO L93 Difference]: Finished difference Result 384 states and 877 transitions. [2021-10-05 22:40:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:04,661 INFO L225 Difference]: With dead ends: 384 [2021-10-05 22:40:04,661 INFO L226 Difference]: Without dead ends: 366 [2021-10-05 22:40:04,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 98.6ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-05 22:40:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2021-10-05 22:40:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.3185595567867034) internal successors, (837), 361 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 837 transitions. [2021-10-05 22:40:04,672 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 837 transitions. Word has length 29 [2021-10-05 22:40:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:04,673 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 837 transitions. [2021-10-05 22:40:04,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 837 transitions. [2021-10-05 22:40:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:04,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:04,675 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:04,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 22:40:04,675 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1931529602, now seen corresponding path program 10 times [2021-10-05 22:40:04,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:04,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654891561] [2021-10-05 22:40:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:04,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:04,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:04,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654891561] [2021-10-05 22:40:04,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654891561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:04,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:04,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:04,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610082143] [2021-10-05 22:40:04,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:04,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:04,858 INFO L87 Difference]: Start difference. First operand 362 states and 837 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:05,021 INFO L93 Difference]: Finished difference Result 384 states and 872 transitions. [2021-10-05 22:40:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:05,024 INFO L225 Difference]: With dead ends: 384 [2021-10-05 22:40:05,024 INFO L226 Difference]: Without dead ends: 352 [2021-10-05 22:40:05,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 84.6ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-05 22:40:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2021-10-05 22:40:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.297994269340974) internal successors, (802), 349 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 802 transitions. [2021-10-05 22:40:05,035 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 802 transitions. Word has length 29 [2021-10-05 22:40:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:05,038 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 802 transitions. [2021-10-05 22:40:05,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 802 transitions. [2021-10-05 22:40:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:05,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:05,040 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:05,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 22:40:05,040 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2043073786, now seen corresponding path program 11 times [2021-10-05 22:40:05,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:05,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153507403] [2021-10-05 22:40:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:05,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:05,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:05,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153507403] [2021-10-05 22:40:05,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153507403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:05,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:05,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:05,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676155558] [2021-10-05 22:40:05,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:05,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:05,227 INFO L87 Difference]: Start difference. First operand 350 states and 802 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:05,437 INFO L93 Difference]: Finished difference Result 406 states and 913 transitions. [2021-10-05 22:40:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:05,441 INFO L225 Difference]: With dead ends: 406 [2021-10-05 22:40:05,441 INFO L226 Difference]: Without dead ends: 382 [2021-10-05 22:40:05,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 109.0ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:40:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-05 22:40:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 350. [2021-10-05 22:40:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.286532951289398) internal successors, (798), 349 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 798 transitions. [2021-10-05 22:40:05,453 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 798 transitions. Word has length 29 [2021-10-05 22:40:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:05,454 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 798 transitions. [2021-10-05 22:40:05,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 798 transitions. [2021-10-05 22:40:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:05,455 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:05,455 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:05,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 22:40:05,456 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1836092230, now seen corresponding path program 12 times [2021-10-05 22:40:05,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:05,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526949065] [2021-10-05 22:40:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:05,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:05,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:05,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526949065] [2021-10-05 22:40:05,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526949065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:05,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:05,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:05,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793048825] [2021-10-05 22:40:05,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:05,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:05,621 INFO L87 Difference]: Start difference. First operand 350 states and 798 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:05,855 INFO L93 Difference]: Finished difference Result 396 states and 889 transitions. [2021-10-05 22:40:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:05,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:05,859 INFO L225 Difference]: With dead ends: 396 [2021-10-05 22:40:05,859 INFO L226 Difference]: Without dead ends: 378 [2021-10-05 22:40:05,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 135.8ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:40:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-05 22:40:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 346. [2021-10-05 22:40:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.2869565217391306) internal successors, (789), 345 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 789 transitions. [2021-10-05 22:40:05,871 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 789 transitions. Word has length 29 [2021-10-05 22:40:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:05,871 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 789 transitions. [2021-10-05 22:40:05,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 789 transitions. [2021-10-05 22:40:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:05,873 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:05,873 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:05,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 22:40:05,874 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1280071376, now seen corresponding path program 13 times [2021-10-05 22:40:05,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:05,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904433792] [2021-10-05 22:40:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:05,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:06,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:06,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904433792] [2021-10-05 22:40:06,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904433792] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:06,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:06,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:06,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849532071] [2021-10-05 22:40:06,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:06,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:06,015 INFO L87 Difference]: Start difference. First operand 346 states and 789 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:06,204 INFO L93 Difference]: Finished difference Result 386 states and 869 transitions. [2021-10-05 22:40:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:06,207 INFO L225 Difference]: With dead ends: 386 [2021-10-05 22:40:06,207 INFO L226 Difference]: Without dead ends: 362 [2021-10-05 22:40:06,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-05 22:40:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2021-10-05 22:40:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.2882882882882885) internal successors, (762), 333 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 762 transitions. [2021-10-05 22:40:06,235 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 762 transitions. Word has length 29 [2021-10-05 22:40:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:06,235 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 762 transitions. [2021-10-05 22:40:06,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 762 transitions. [2021-10-05 22:40:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:06,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:06,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:06,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 22:40:06,238 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1234713778, now seen corresponding path program 14 times [2021-10-05 22:40:06,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:06,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277961099] [2021-10-05 22:40:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:06,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:06,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:06,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277961099] [2021-10-05 22:40:06,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277961099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:06,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:06,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:06,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772922576] [2021-10-05 22:40:06,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:06,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:06,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:06,428 INFO L87 Difference]: Start difference. First operand 334 states and 762 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:06,649 INFO L93 Difference]: Finished difference Result 240 states and 491 transitions. [2021-10-05 22:40:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:06,652 INFO L225 Difference]: With dead ends: 240 [2021-10-05 22:40:06,652 INFO L226 Difference]: Without dead ends: 194 [2021-10-05 22:40:06,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 88.8ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-05 22:40:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2021-10-05 22:40:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.0177514792899407) internal successors, (341), 169 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 341 transitions. [2021-10-05 22:40:06,667 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 341 transitions. Word has length 29 [2021-10-05 22:40:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:06,668 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 341 transitions. [2021-10-05 22:40:06,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 341 transitions. [2021-10-05 22:40:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:06,669 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:06,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:06,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 22:40:06,670 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1494680976, now seen corresponding path program 15 times [2021-10-05 22:40:06,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:06,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490363823] [2021-10-05 22:40:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:06,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:06,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:06,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490363823] [2021-10-05 22:40:06,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490363823] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:06,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:06,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:06,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520846406] [2021-10-05 22:40:06,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:06,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:06,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:06,832 INFO L87 Difference]: Start difference. First operand 170 states and 341 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:07,079 INFO L93 Difference]: Finished difference Result 212 states and 424 transitions. [2021-10-05 22:40:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:07,081 INFO L225 Difference]: With dead ends: 212 [2021-10-05 22:40:07,081 INFO L226 Difference]: Without dead ends: 192 [2021-10-05 22:40:07,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 126.1ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:40:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-05 22:40:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2021-10-05 22:40:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.012121212121212) internal successors, (332), 165 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 332 transitions. [2021-10-05 22:40:07,087 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 332 transitions. Word has length 29 [2021-10-05 22:40:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:07,088 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 332 transitions. [2021-10-05 22:40:07,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 332 transitions. [2021-10-05 22:40:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:07,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:07,089 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:07,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 22:40:07,089 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:07,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash -562881018, now seen corresponding path program 16 times [2021-10-05 22:40:07,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:07,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351648239] [2021-10-05 22:40:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:07,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:07,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:07,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351648239] [2021-10-05 22:40:07,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351648239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:07,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:07,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:07,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055059437] [2021-10-05 22:40:07,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:07,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:07,214 INFO L87 Difference]: Start difference. First operand 166 states and 332 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:07,406 INFO L93 Difference]: Finished difference Result 178 states and 350 transitions. [2021-10-05 22:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:07,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:07,408 INFO L225 Difference]: With dead ends: 178 [2021-10-05 22:40:07,408 INFO L226 Difference]: Without dead ends: 162 [2021-10-05 22:40:07,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:40:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-05 22:40:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2021-10-05 22:40:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.9937106918238994) internal successors, (317), 159 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 317 transitions. [2021-10-05 22:40:07,412 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 317 transitions. Word has length 29 [2021-10-05 22:40:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:07,413 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 317 transitions. [2021-10-05 22:40:07,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 317 transitions. [2021-10-05 22:40:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:07,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:07,414 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:07,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 22:40:07,414 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -731678566, now seen corresponding path program 17 times [2021-10-05 22:40:07,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:07,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762153057] [2021-10-05 22:40:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:07,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:07,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:07,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762153057] [2021-10-05 22:40:07,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762153057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:07,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:07,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:07,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739651477] [2021-10-05 22:40:07,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:07,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:07,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:07,541 INFO L87 Difference]: Start difference. First operand 160 states and 317 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:07,797 INFO L93 Difference]: Finished difference Result 140 states and 267 transitions. [2021-10-05 22:40:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:07,799 INFO L225 Difference]: With dead ends: 140 [2021-10-05 22:40:07,799 INFO L226 Difference]: Without dead ends: 98 [2021-10-05 22:40:07,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 125.8ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:40:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-05 22:40:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-10-05 22:40:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.9690721649484537) internal successors, (191), 97 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 191 transitions. [2021-10-05 22:40:07,803 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 191 transitions. Word has length 29 [2021-10-05 22:40:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:07,803 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 191 transitions. [2021-10-05 22:40:07,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 191 transitions. [2021-10-05 22:40:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:07,805 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:07,805 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:07,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 22:40:07,805 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1744562616, now seen corresponding path program 18 times [2021-10-05 22:40:07,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:07,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988832822] [2021-10-05 22:40:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:07,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:07,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:07,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988832822] [2021-10-05 22:40:07,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988832822] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:07,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:07,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:07,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149863852] [2021-10-05 22:40:07,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:07,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:07,924 INFO L87 Difference]: Start difference. First operand 98 states and 191 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:08,096 INFO L93 Difference]: Finished difference Result 110 states and 209 transitions. [2021-10-05 22:40:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:08,097 INFO L225 Difference]: With dead ends: 110 [2021-10-05 22:40:08,098 INFO L226 Difference]: Without dead ends: 94 [2021-10-05 22:40:08,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 104.5ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-10-05 22:40:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2021-10-05 22:40:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.934065934065934) internal successors, (176), 91 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 176 transitions. [2021-10-05 22:40:08,101 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 176 transitions. Word has length 29 [2021-10-05 22:40:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:08,102 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 176 transitions. [2021-10-05 22:40:08,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 176 transitions. [2021-10-05 22:40:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:08,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:08,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:08,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 22:40:08,103 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1473317076, now seen corresponding path program 19 times [2021-10-05 22:40:08,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:08,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788561449] [2021-10-05 22:40:08,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:08,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:08,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:08,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788561449] [2021-10-05 22:40:08,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788561449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:08,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:08,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:08,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726822476] [2021-10-05 22:40:08,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:08,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:08,226 INFO L87 Difference]: Start difference. First operand 92 states and 176 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:08,420 INFO L93 Difference]: Finished difference Result 164 states and 326 transitions. [2021-10-05 22:40:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:40:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:08,422 INFO L225 Difference]: With dead ends: 164 [2021-10-05 22:40:08,422 INFO L226 Difference]: Without dead ends: 152 [2021-10-05 22:40:08,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 112.2ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-10-05 22:40:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 94. [2021-10-05 22:40:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.924731182795699) internal successors, (179), 93 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 179 transitions. [2021-10-05 22:40:08,426 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 179 transitions. Word has length 29 [2021-10-05 22:40:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:08,427 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 179 transitions. [2021-10-05 22:40:08,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 179 transitions. [2021-10-05 22:40:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:08,428 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:08,428 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:08,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 22:40:08,429 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1118766604, now seen corresponding path program 20 times [2021-10-05 22:40:08,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:08,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417347823] [2021-10-05 22:40:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:08,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:08,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:08,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417347823] [2021-10-05 22:40:08,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417347823] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:08,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:08,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:08,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33149761] [2021-10-05 22:40:08,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:08,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:08,574 INFO L87 Difference]: Start difference. First operand 94 states and 179 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:08,809 INFO L93 Difference]: Finished difference Result 162 states and 319 transitions. [2021-10-05 22:40:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:08,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:08,811 INFO L225 Difference]: With dead ends: 162 [2021-10-05 22:40:08,811 INFO L226 Difference]: Without dead ends: 144 [2021-10-05 22:40:08,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 148.7ms TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-10-05 22:40:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-05 22:40:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 86. [2021-10-05 22:40:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.8941176470588235) internal successors, (161), 85 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 161 transitions. [2021-10-05 22:40:08,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 161 transitions. Word has length 29 [2021-10-05 22:40:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:08,815 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 161 transitions. [2021-10-05 22:40:08,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 161 transitions. [2021-10-05 22:40:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:08,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:08,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:08,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 22:40:08,817 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2076271824, now seen corresponding path program 21 times [2021-10-05 22:40:08,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:08,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168831973] [2021-10-05 22:40:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:08,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:08,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:08,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168831973] [2021-10-05 22:40:08,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168831973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:08,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:08,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:08,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229268340] [2021-10-05 22:40:08,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:08,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:08,954 INFO L87 Difference]: Start difference. First operand 86 states and 161 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:09,154 INFO L93 Difference]: Finished difference Result 120 states and 222 transitions. [2021-10-05 22:40:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:40:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:09,157 INFO L225 Difference]: With dead ends: 120 [2021-10-05 22:40:09,157 INFO L226 Difference]: Without dead ends: 80 [2021-10-05 22:40:09,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:40:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-05 22:40:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-10-05 22:40:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.8481012658227849) internal successors, (146), 79 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 146 transitions. [2021-10-05 22:40:09,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 146 transitions. Word has length 29 [2021-10-05 22:40:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:09,161 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 146 transitions. [2021-10-05 22:40:09,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 146 transitions. [2021-10-05 22:40:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:09,162 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:09,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:09,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 22:40:09,163 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash -247382232, now seen corresponding path program 22 times [2021-10-05 22:40:09,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:09,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666031765] [2021-10-05 22:40:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:09,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:09,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:09,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666031765] [2021-10-05 22:40:09,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666031765] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:09,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:09,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:09,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431795126] [2021-10-05 22:40:09,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:09,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:09,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:09,274 INFO L87 Difference]: Start difference. First operand 80 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:09,403 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2021-10-05 22:40:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:09,404 INFO L225 Difference]: With dead ends: 122 [2021-10-05 22:40:09,404 INFO L226 Difference]: Without dead ends: 110 [2021-10-05 22:40:09,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 69.5ms TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:40:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-05 22:40:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2021-10-05 22:40:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 79 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 144 transitions. [2021-10-05 22:40:09,408 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 144 transitions. Word has length 29 [2021-10-05 22:40:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:09,408 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 144 transitions. [2021-10-05 22:40:09,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 144 transitions. [2021-10-05 22:40:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:09,409 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:09,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:09,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 22:40:09,410 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1455501384, now seen corresponding path program 23 times [2021-10-05 22:40:09,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:09,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793724633] [2021-10-05 22:40:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:09,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:09,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:09,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793724633] [2021-10-05 22:40:09,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793724633] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:09,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:09,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:09,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349984167] [2021-10-05 22:40:09,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:09,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:09,525 INFO L87 Difference]: Start difference. First operand 80 states and 144 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:09,682 INFO L93 Difference]: Finished difference Result 120 states and 224 transitions. [2021-10-05 22:40:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:40:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:09,684 INFO L225 Difference]: With dead ends: 120 [2021-10-05 22:40:09,684 INFO L226 Difference]: Without dead ends: 108 [2021-10-05 22:40:09,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:40:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-05 22:40:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2021-10-05 22:40:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 77 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2021-10-05 22:40:09,687 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 29 [2021-10-05 22:40:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:09,688 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2021-10-05 22:40:09,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2021-10-05 22:40:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:09,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:09,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:09,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 22:40:09,689 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1343410852, now seen corresponding path program 24 times [2021-10-05 22:40:09,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:09,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560916339] [2021-10-05 22:40:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:09,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:09,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:09,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560916339] [2021-10-05 22:40:09,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560916339] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:09,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:09,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:09,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428009747] [2021-10-05 22:40:09,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:09,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:09,794 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:09,898 INFO L93 Difference]: Finished difference Result 116 states and 216 transitions. [2021-10-05 22:40:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:09,899 INFO L225 Difference]: With dead ends: 116 [2021-10-05 22:40:09,899 INFO L226 Difference]: Without dead ends: 104 [2021-10-05 22:40:09,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:40:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-05 22:40:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2021-10-05 22:40:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2021-10-05 22:40:09,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 29 [2021-10-05 22:40:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:09,903 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2021-10-05 22:40:09,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2021-10-05 22:40:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:09,904 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:09,904 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:09,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 22:40:09,904 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1019400392, now seen corresponding path program 25 times [2021-10-05 22:40:09,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:09,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339513490] [2021-10-05 22:40:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:09,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:10,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:10,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339513490] [2021-10-05 22:40:10,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339513490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:10,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:10,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:40:10,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530932069] [2021-10-05 22:40:10,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:40:10,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:10,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:40:10,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:40:10,013 INFO L87 Difference]: Start difference. First operand 74 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:10,127 INFO L93 Difference]: Finished difference Result 116 states and 214 transitions. [2021-10-05 22:40:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:10,129 INFO L225 Difference]: With dead ends: 116 [2021-10-05 22:40:10,129 INFO L226 Difference]: Without dead ends: 96 [2021-10-05 22:40:10,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:40:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-05 22:40:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2021-10-05 22:40:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 71 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 124 transitions. [2021-10-05 22:40:10,133 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 124 transitions. Word has length 29 [2021-10-05 22:40:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:10,133 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 124 transitions. [2021-10-05 22:40:10,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 124 transitions. [2021-10-05 22:40:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 22:40:10,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:40:10,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 22:40:10,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 22:40:10,135 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:40:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:40:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1111716, now seen corresponding path program 26 times [2021-10-05 22:40:10,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:40:10,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575985037] [2021-10-05 22:40:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:40:10,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:40:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:40:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:40:10,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:40:10,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575985037] [2021-10-05 22:40:10,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575985037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:40:10,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:40:10,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:40:10,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101861568] [2021-10-05 22:40:10,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:40:10,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:40:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:40:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:40:10,255 INFO L87 Difference]: Start difference. First operand 72 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:40:10,354 INFO L93 Difference]: Finished difference Result 38 states and 62 transitions. [2021-10-05 22:40:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:40:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-05 22:40:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:40:10,355 INFO L225 Difference]: With dead ends: 38 [2021-10-05 22:40:10,355 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 22:40:10,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:40:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 22:40:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 22:40:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 22:40:10,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-05 22:40:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:40:10,356 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 22:40:10,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:40:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 22:40:10,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 22:40:10,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 22:40:10,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 22:40:10,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 22:40:10,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 22:40:10,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 22:40:10,365 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 22:40:10,365 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 22:40:10,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:40:10 BasicIcfg [2021-10-05 22:40:10,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 22:40:10,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 22:40:10,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 22:40:10,368 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 22:40:10,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:39:54" (3/4) ... [2021-10-05 22:40:10,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 22:40:10,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 22:40:10,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 22:40:10,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 22:40:10,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-10-05 22:40:10,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 22:40:10,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 22:40:10,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 22:40:10,433 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 22:40:10,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 22:40:10,436 INFO L168 Benchmark]: Toolchain (without parser) took 17170.44 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 28.9 MB in the beginning and 57.3 MB in the end (delta: -28.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,437 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 39.8 MB. Free memory was 19.2 MB in the beginning and 19.1 MB in the end (delta: 28.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:40:10,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.64 ms. Allocated memory is still 52.4 MB. Free memory was 28.6 MB in the beginning and 31.4 MB in the end (delta: -2.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 52.4 MB. Free memory was 31.4 MB in the beginning and 29.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,439 INFO L168 Benchmark]: Boogie Preprocessor took 39.64 ms. Allocated memory is still 52.4 MB. Free memory was 29.5 MB in the beginning and 28.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:40:10,439 INFO L168 Benchmark]: RCFGBuilder took 592.53 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 26.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,440 INFO L168 Benchmark]: TraceAbstraction took 16128.63 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 25.7 MB in the beginning and 60.5 MB in the end (delta: -34.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,440 INFO L168 Benchmark]: Witness Printer took 66.15 ms. Allocated memory is still 111.1 MB. Free memory was 60.5 MB in the beginning and 57.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 22:40:10,443 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.24 ms. Allocated memory is still 39.8 MB. Free memory was 19.2 MB in the beginning and 19.1 MB in the end (delta: 28.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 279.64 ms. Allocated memory is still 52.4 MB. Free memory was 28.6 MB in the beginning and 31.4 MB in the end (delta: -2.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 52.4 MB. Free memory was 31.4 MB in the beginning and 29.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.64 ms. Allocated memory is still 52.4 MB. Free memory was 29.5 MB in the beginning and 28.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 592.53 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 26.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16128.63 ms. Allocated memory was 52.4 MB in the beginning and 111.1 MB in the end (delta: 58.7 MB). Free memory was 25.7 MB in the beginning and 60.5 MB in the end (delta: -34.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. * Witness Printer took 66.15 ms. Allocated memory is still 111.1 MB. Free memory was 60.5 MB in the beginning and 57.3 MB in the end (delta: 3.1 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 Lipton Reduction Statistics: ReductionTime: 5061.5ms, 134 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 6175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2958, positive: 2770, positive conditional: 0, positive unconditional: 2770, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1567, positive: 1520, positive conditional: 0, positive unconditional: 1520, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1567, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2958, positive: 1250, positive conditional: 0, positive unconditional: 1250, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 1567, unknown conditional: 0, unknown unconditional: 1567] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 104]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 168 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 15917.1ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 73.1ms, AutomataDifference: 5510.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5174.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 923 SDtfs, 1393 SDslu, 3746 SDs, 0 SdLazy, 4883 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2755.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2639.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=696occurred in iteration=5, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 431.2ms AutomataMinimizationTime, 27 MinimizatonAttempts, 912 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 70.6ms SsaConstructionTime, 1072.1ms SatisfiabilityAnalysisTime, 3180.5ms InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 3717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 22:40:10,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...