./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67f75038da5597fb60fd0aa63a920af562c2c67b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 14:41:43,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:41:43,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:41:43,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:41:43,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:41:43,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:41:43,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:41:43,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:41:43,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:41:43,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:41:43,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:41:43,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:41:43,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:41:43,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:41:43,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:41:43,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:41:43,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:41:43,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:41:43,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:41:43,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:41:43,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:41:43,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:41:43,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:41:43,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:41:43,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:41:43,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:41:43,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:41:43,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:41:43,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:41:43,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:41:43,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:41:43,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:41:43,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:41:43,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:41:43,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:41:43,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:41:43,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:41:43,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:41:43,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:41:43,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:41:43,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:41:43,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:41:43,250 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:41:43,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:41:43,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:41:43,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:41:43,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:41:43,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:41:43,253 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:41:43,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:41:43,253 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:41:43,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:41:43,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:41:43,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:41:43,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:41:43,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:41:43,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:41:43,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:41:43,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:41:43,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:41:43,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:41:43,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:41:43,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67f75038da5597fb60fd0aa63a920af562c2c67b [2021-08-26 14:41:43,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:41:43,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:41:43,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:41:43,518 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:41:43,518 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:41:43,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2021-08-26 14:41:43,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2ee3f19/771e6c4f056042c1b9c57adba79fb8b4/FLAGad7891ca5 [2021-08-26 14:41:43,993 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:41:43,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2021-08-26 14:41:44,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2ee3f19/771e6c4f056042c1b9c57adba79fb8b4/FLAGad7891ca5 [2021-08-26 14:41:44,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2ee3f19/771e6c4f056042c1b9c57adba79fb8b4 [2021-08-26 14:41:44,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:41:44,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:41:44,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:41:44,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:41:44,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:41:44,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221ebbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44, skipping insertion in model container [2021-08-26 14:41:44,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:41:44,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:41:44,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i[949,962] [2021-08-26 14:41:44,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:41:44,318 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:41:44,326 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i[949,962] [2021-08-26 14:41:44,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:41:44,397 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:41:44,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44 WrapperNode [2021-08-26 14:41:44,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:41:44,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:41:44,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:41:44,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:41:44,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:41:44,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:41:44,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:41:44,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:41:44,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:41:44,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:41:44,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:41:44,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:41:44,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (1/1) ... [2021-08-26 14:41:44,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:41:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:41:44,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:41:44,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:41:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:41:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:41:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:41:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:41:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-26 14:41:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-26 14:41:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-26 14:41:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-26 14:41:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-26 14:41:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-26 14:41:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:41:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:41:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:41:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:41:44,585 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:41:45,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:41:45,887 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 14:41:45,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:45 BoogieIcfgContainer [2021-08-26 14:41:45,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:41:45,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:41:45,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:41:45,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:41:45,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:41:44" (1/3) ... [2021-08-26 14:41:45,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b010a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:41:45, skipping insertion in model container [2021-08-26 14:41:45,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:44" (2/3) ... [2021-08-26 14:41:45,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b010a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:41:45, skipping insertion in model container [2021-08-26 14:41:45,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:45" (3/3) ... [2021-08-26 14:41:45,897 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2021-08-26 14:41:45,900 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:41:45,900 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:41:45,900 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 14:41:45,901 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:41:45,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,933 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,933 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,943 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,943 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,943 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,945 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,954 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:45,969 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-26 14:41:46,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:41:46,010 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-08-26 14:41:46,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-26 14:41:46,032 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:41:46,039 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 223 flow [2021-08-26 14:41:46,041 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 223 flow [2021-08-26 14:41:46,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-08-26 14:41:46,078 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-08-26 14:41:46,078 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-26 14:41:46,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-08-26 14:41:46,084 INFO L116 LiptonReduction]: Number of co-enabled transitions 1734 [2021-08-26 14:41:53,567 INFO L131 LiptonReduction]: Checked pairs total: 4116 [2021-08-26 14:41:53,567 INFO L133 LiptonReduction]: Total number of compositions: 90 [2021-08-26 14:41:53,572 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-08-26 14:41:53,600 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 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-08-26 14:41:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 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-08-26 14:41:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 14:41:53,607 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:53,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:53,608 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1316732038, now seen corresponding path program 1 times [2021-08-26 14:41:53,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:53,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928213189] [2021-08-26 14:41:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:53,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:53,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:53,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928213189] [2021-08-26 14:41:53,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928213189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:53,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:53,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:41:53,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964779889] [2021-08-26 14:41:53,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:41:53,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:41:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:41:53,827 INFO L87 Difference]: Start difference. First operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 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 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-08-26 14:41:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:53,867 INFO L93 Difference]: Finished difference Result 570 states and 1744 transitions. [2021-08-26 14:41:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:41:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-08-26 14:41:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:53,884 INFO L225 Difference]: With dead ends: 570 [2021-08-26 14:41:53,887 INFO L226 Difference]: Without dead ends: 550 [2021-08-26 14:41:53,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:41:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-08-26 14:41:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-08-26 14:41:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 0 states have call successors, (0), 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-08-26 14:41:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2021-08-26 14:41:53,961 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2021-08-26 14:41:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:53,962 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2021-08-26 14:41:53,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-08-26 14:41:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2021-08-26 14:41:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:41:53,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:53,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:53,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:41:53,964 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -826496317, now seen corresponding path program 1 times [2021-08-26 14:41:53,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:53,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682161369] [2021-08-26 14:41:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:53,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:54,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682161369] [2021-08-26 14:41:54,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682161369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:41:54,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879043186] [2021-08-26 14:41:54,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:54,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:54,078 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-08-26 14:41:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,104 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2021-08-26 14:41:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:54,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-08-26 14:41:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,109 INFO L225 Difference]: With dead ends: 630 [2021-08-26 14:41:54,109 INFO L226 Difference]: Without dead ends: 530 [2021-08-26 14:41:54,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-26 14:41:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-08-26 14:41:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.056710775047259) internal successors, (1617), 529 states have internal predecessors, (1617), 0 states have call successors, (0), 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-08-26 14:41:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2021-08-26 14:41:54,120 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2021-08-26 14:41:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,120 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2021-08-26 14:41:54,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-08-26 14:41:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2021-08-26 14:41:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:41:54,125 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:41:54,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -36677151, now seen corresponding path program 1 times [2021-08-26 14:41:54,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685229060] [2021-08-26 14:41:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,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-08-26 14:41:54,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685229060] [2021-08-26 14:41:54,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685229060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:41:54,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571236306] [2021-08-26 14:41:54,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:54,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:54,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:54,213 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-08-26 14:41:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,234 INFO L93 Difference]: Finished difference Result 594 states and 1749 transitions. [2021-08-26 14:41:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-08-26 14:41:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,237 INFO L225 Difference]: With dead ends: 594 [2021-08-26 14:41:54,237 INFO L226 Difference]: Without dead ends: 514 [2021-08-26 14:41:54,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-08-26 14:41:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2021-08-26 14:41:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 3.0350877192982457) internal successors, (1557), 513 states have internal predecessors, (1557), 0 states have call successors, (0), 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-08-26 14:41:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2021-08-26 14:41:54,247 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2021-08-26 14:41:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,247 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2021-08-26 14:41:54,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-08-26 14:41:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2021-08-26 14:41:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:41:54,248 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:41:54,249 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash 201605146, now seen corresponding path program 1 times [2021-08-26 14:41:54,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840517140] [2021-08-26 14:41:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:54,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840517140] [2021-08-26 14:41:54,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840517140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:54,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177507842] [2021-08-26 14:41:54,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:54,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:54,322 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-08-26 14:41:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,346 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2021-08-26 14:41:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-26 14:41:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,349 INFO L225 Difference]: With dead ends: 800 [2021-08-26 14:41:54,349 INFO L226 Difference]: Without dead ends: 574 [2021-08-26 14:41:54,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-08-26 14:41:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2021-08-26 14:41:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.8864097363083165) internal successors, (1423), 493 states have internal predecessors, (1423), 0 states have call successors, (0), 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-08-26 14:41:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2021-08-26 14:41:54,360 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2021-08-26 14:41:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,360 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2021-08-26 14:41:54,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-08-26 14:41:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2021-08-26 14:41:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:41:54,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:41:54,362 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 537088343, now seen corresponding path program 1 times [2021-08-26 14:41:54,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885173027] [2021-08-26 14:41:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:54,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885173027] [2021-08-26 14:41:54,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885173027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:54,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235544698] [2021-08-26 14:41:54,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:41:54,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:41:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:54,484 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-08-26 14:41:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,533 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2021-08-26 14:41:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-26 14:41:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,536 INFO L225 Difference]: With dead ends: 548 [2021-08-26 14:41:54,538 INFO L226 Difference]: Without dead ends: 488 [2021-08-26 14:41:54,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-08-26 14:41:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2021-08-26 14:41:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 2.8767967145790556) internal successors, (1401), 487 states have internal predecessors, (1401), 0 states have call successors, (0), 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-08-26 14:41:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2021-08-26 14:41:54,547 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2021-08-26 14:41:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,548 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2021-08-26 14:41:54,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-08-26 14:41:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2021-08-26 14:41:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:41:54,549 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:41:54,549 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash -543856079, now seen corresponding path program 1 times [2021-08-26 14:41:54,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389805332] [2021-08-26 14:41:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:54,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389805332] [2021-08-26 14:41:54,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389805332] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:54,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558161049] [2021-08-26 14:41:54,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:41:54,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:41:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:54,681 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-08-26 14:41:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,753 INFO L93 Difference]: Finished difference Result 534 states and 1489 transitions. [2021-08-26 14:41:54,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-08-26 14:41:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,756 INFO L225 Difference]: With dead ends: 534 [2021-08-26 14:41:54,756 INFO L226 Difference]: Without dead ends: 474 [2021-08-26 14:41:54,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:41:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-26 14:41:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-08-26 14:41:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.8520084566596196) internal successors, (1349), 473 states have internal predecessors, (1349), 0 states have call successors, (0), 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-08-26 14:41:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1349 transitions. [2021-08-26 14:41:54,764 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1349 transitions. Word has length 13 [2021-08-26 14:41:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,765 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1349 transitions. [2021-08-26 14:41:54,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-08-26 14:41:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1349 transitions. [2021-08-26 14:41:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:41:54,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:41:54,766 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,767 INFO L82 PathProgramCache]: Analyzing trace with hash -590955650, now seen corresponding path program 1 times [2021-08-26 14:41:54,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731163596] [2021-08-26 14:41:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:54,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:54,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731163596] [2021-08-26 14:41:54,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731163596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:54,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:54,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:54,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819512246] [2021-08-26 14:41:54,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:41:54,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:41:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:54,853 INFO L87 Difference]: Start difference. First operand 474 states and 1349 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-08-26 14:41:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:54,916 INFO L93 Difference]: Finished difference Result 505 states and 1407 transitions. [2021-08-26 14:41:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-08-26 14:41:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:54,918 INFO L225 Difference]: With dead ends: 505 [2021-08-26 14:41:54,918 INFO L226 Difference]: Without dead ends: 460 [2021-08-26 14:41:54,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-26 14:41:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2021-08-26 14:41:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.832967032967033) internal successors, (1289), 455 states have internal predecessors, (1289), 0 states have call successors, (0), 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-08-26 14:41:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1289 transitions. [2021-08-26 14:41:54,927 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1289 transitions. Word has length 13 [2021-08-26 14:41:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:54,927 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1289 transitions. [2021-08-26 14:41:54,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-08-26 14:41:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1289 transitions. [2021-08-26 14:41:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:41:54,928 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:54,928 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:54,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:41:54,929 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 259505636, now seen corresponding path program 1 times [2021-08-26 14:41:54,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:54,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619722680] [2021-08-26 14:41:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:54,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619722680] [2021-08-26 14:41:55,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619722680] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:55,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525825504] [2021-08-26 14:41:55,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:41:55,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:41:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:55,039 INFO L87 Difference]: Start difference. First operand 456 states and 1289 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,137 INFO L93 Difference]: Finished difference Result 573 states and 1602 transitions. [2021-08-26 14:41:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:41:55,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-08-26 14:41:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,139 INFO L225 Difference]: With dead ends: 573 [2021-08-26 14:41:55,139 INFO L226 Difference]: Without dead ends: 520 [2021-08-26 14:41:55,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:41:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-08-26 14:41:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2021-08-26 14:41:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 2.840954274353877) internal successors, (1429), 503 states have internal predecessors, (1429), 0 states have call successors, (0), 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-08-26 14:41:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1429 transitions. [2021-08-26 14:41:55,149 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1429 transitions. Word has length 14 [2021-08-26 14:41:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,149 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1429 transitions. [2021-08-26 14:41:55,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1429 transitions. [2021-08-26 14:41:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:41:55,150 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:41:55,151 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1153481494, now seen corresponding path program 2 times [2021-08-26 14:41:55,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049856090] [2021-08-26 14:41:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049856090] [2021-08-26 14:41:55,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049856090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:55,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308456002] [2021-08-26 14:41:55,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:41:55,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:41:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:55,229 INFO L87 Difference]: Start difference. First operand 504 states and 1429 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,291 INFO L93 Difference]: Finished difference Result 561 states and 1562 transitions. [2021-08-26 14:41:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:41:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-08-26 14:41:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,294 INFO L225 Difference]: With dead ends: 561 [2021-08-26 14:41:55,294 INFO L226 Difference]: Without dead ends: 516 [2021-08-26 14:41:55,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-08-26 14:41:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 492. [2021-08-26 14:41:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.8167006109979633) internal successors, (1383), 491 states have internal predecessors, (1383), 0 states have call successors, (0), 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-08-26 14:41:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1383 transitions. [2021-08-26 14:41:55,311 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1383 transitions. Word has length 14 [2021-08-26 14:41:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,311 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1383 transitions. [2021-08-26 14:41:55,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1383 transitions. [2021-08-26 14:41:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:41:55,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,312 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:41:55,313 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1139729584, now seen corresponding path program 3 times [2021-08-26 14:41:55,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437532503] [2021-08-26 14:41:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437532503] [2021-08-26 14:41:55,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437532503] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:55,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626333775] [2021-08-26 14:41:55,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:41:55,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:41:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:55,388 INFO L87 Difference]: Start difference. First operand 492 states and 1383 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,491 INFO L93 Difference]: Finished difference Result 585 states and 1607 transitions. [2021-08-26 14:41:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:41:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-08-26 14:41:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,496 INFO L225 Difference]: With dead ends: 585 [2021-08-26 14:41:55,496 INFO L226 Difference]: Without dead ends: 526 [2021-08-26 14:41:55,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:41:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-08-26 14:41:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 514. [2021-08-26 14:41:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 2.7855750487329436) internal successors, (1429), 513 states have internal predecessors, (1429), 0 states have call successors, (0), 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-08-26 14:41:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1429 transitions. [2021-08-26 14:41:55,506 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1429 transitions. Word has length 14 [2021-08-26 14:41:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,506 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 1429 transitions. [2021-08-26 14:41:55,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1429 transitions. [2021-08-26 14:41:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:41:55,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,507 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:41:55,507 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash 553266248, now seen corresponding path program 1 times [2021-08-26 14:41:55,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329378498] [2021-08-26 14:41:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329378498] [2021-08-26 14:41:55,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329378498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:55,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189271810] [2021-08-26 14:41:55,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:55,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:55,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:55,541 INFO L87 Difference]: Start difference. First operand 514 states and 1429 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,558 INFO L93 Difference]: Finished difference Result 759 states and 2028 transitions. [2021-08-26 14:41:55,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:55,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-08-26 14:41:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,560 INFO L225 Difference]: With dead ends: 759 [2021-08-26 14:41:55,560 INFO L226 Difference]: Without dead ends: 470 [2021-08-26 14:41:55,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-08-26 14:41:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2021-08-26 14:41:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.6397228637413397) internal successors, (1143), 433 states have internal predecessors, (1143), 0 states have call successors, (0), 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-08-26 14:41:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1143 transitions. [2021-08-26 14:41:55,569 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1143 transitions. Word has length 14 [2021-08-26 14:41:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,569 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1143 transitions. [2021-08-26 14:41:55,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-08-26 14:41:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1143 transitions. [2021-08-26 14:41:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 14:41:55,570 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,570 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:41:55,570 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash -545281544, now seen corresponding path program 1 times [2021-08-26 14:41:55,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793462828] [2021-08-26 14:41:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793462828] [2021-08-26 14:41:55,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793462828] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:41:55,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135025436] [2021-08-26 14:41:55,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:41:55,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:41:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:41:55,683 INFO L87 Difference]: Start difference. First operand 434 states and 1143 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-08-26 14:41:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,809 INFO L93 Difference]: Finished difference Result 530 states and 1345 transitions. [2021-08-26 14:41:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 14:41:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-26 14:41:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,811 INFO L225 Difference]: With dead ends: 530 [2021-08-26 14:41:55,811 INFO L226 Difference]: Without dead ends: 326 [2021-08-26 14:41:55,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:41:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-26 14:41:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 272. [2021-08-26 14:41:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.5645756457564577) internal successors, (695), 271 states have internal predecessors, (695), 0 states have call successors, (0), 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-08-26 14:41:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 695 transitions. [2021-08-26 14:41:55,819 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 695 transitions. Word has length 15 [2021-08-26 14:41:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,819 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 695 transitions. [2021-08-26 14:41:55,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-08-26 14:41:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 695 transitions. [2021-08-26 14:41:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 14:41:55,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,820 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:41:55,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash -28591036, now seen corresponding path program 1 times [2021-08-26 14:41:55,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322303893] [2021-08-26 14:41:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,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-08-26 14:41:55,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322303893] [2021-08-26 14:41:55,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322303893] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:55,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536976726] [2021-08-26 14:41:55,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:55,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:55,889 INFO L87 Difference]: Start difference. First operand 272 states and 695 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-08-26 14:41:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,904 INFO L93 Difference]: Finished difference Result 266 states and 588 transitions. [2021-08-26 14:41:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:41:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-26 14:41:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,905 INFO L225 Difference]: With dead ends: 266 [2021-08-26 14:41:55,905 INFO L226 Difference]: Without dead ends: 196 [2021-08-26 14:41:55,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-26 14:41:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-08-26 14:41:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.1794871794871793) internal successors, (425), 195 states have internal predecessors, (425), 0 states have call successors, (0), 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-08-26 14:41:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 425 transitions. [2021-08-26 14:41:55,910 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 425 transitions. Word has length 15 [2021-08-26 14:41:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,910 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 425 transitions. [2021-08-26 14:41:55,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-08-26 14:41:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 425 transitions. [2021-08-26 14:41:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:41:55,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,910 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:41:55,911 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -997626623, now seen corresponding path program 1 times [2021-08-26 14:41:55,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569080689] [2021-08-26 14:41:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:55,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:55,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569080689] [2021-08-26 14:41:55,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569080689] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:55,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:55,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:55,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626334326] [2021-08-26 14:41:55,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:41:55,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:41:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:55,957 INFO L87 Difference]: Start difference. First operand 196 states and 425 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:41:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:55,981 INFO L93 Difference]: Finished difference Result 156 states and 293 transitions. [2021-08-26 14:41:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:41:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:55,982 INFO L225 Difference]: With dead ends: 156 [2021-08-26 14:41:55,982 INFO L226 Difference]: Without dead ends: 114 [2021-08-26 14:41:55,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-26 14:41:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-08-26 14:41:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.7964601769911503) internal successors, (203), 113 states have internal predecessors, (203), 0 states have call successors, (0), 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-08-26 14:41:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 203 transitions. [2021-08-26 14:41:55,985 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 203 transitions. Word has length 16 [2021-08-26 14:41:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:55,985 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 203 transitions. [2021-08-26 14:41:55,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:41:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 203 transitions. [2021-08-26 14:41:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 14:41:55,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:55,986 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:55,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 14:41:55,986 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1781703993, now seen corresponding path program 1 times [2021-08-26 14:41:55,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:55,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536591186] [2021-08-26 14:41:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:55,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:56,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:56,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536591186] [2021-08-26 14:41:56,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536591186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:56,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:56,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:56,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724714987] [2021-08-26 14:41:56,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:41:56,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:41:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:56,039 INFO L87 Difference]: Start difference. First operand 114 states and 203 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-08-26 14:41:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:56,075 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2021-08-26 14:41:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:56,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-08-26 14:41:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:56,076 INFO L225 Difference]: With dead ends: 94 [2021-08-26 14:41:56,076 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 14:41:56,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-08-26 14:41:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 14:41:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-26 14:41:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 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-08-26 14:41:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-08-26 14:41:56,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 18 [2021-08-26 14:41:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:56,078 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-08-26 14:41:56,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-08-26 14:41:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-08-26 14:41:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:41:56,078 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:56,078 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] [2021-08-26 14:41:56,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 14:41:56,079 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:41:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -373911187, now seen corresponding path program 1 times [2021-08-26 14:41:56,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:56,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154187036] [2021-08-26 14:41:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:56,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:41:56,100 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:41:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:41:56,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:41:56,142 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:41:56,142 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:56,143 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:56,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:41:56,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:41:56,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-26 14:41:56,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:56,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 14:41:56,148 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:41:56,148 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:41:56,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:41:56 BasicIcfg [2021-08-26 14:41:56,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:41:56,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:41:56,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:41:56,190 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:41:56,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:45" (3/4) ... [2021-08-26 14:41:56,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:41:56,235 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:41:56,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:41:56,236 INFO L168 Benchmark]: Toolchain (without parser) took 12211.90 ms. Allocated memory was 52.4 MB in the beginning and 285.2 MB in the end (delta: 232.8 MB). Free memory was 28.2 MB in the beginning and 140.2 MB in the end (delta: -112.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,236 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 52.4 MB. Free memory was 33.7 MB in the beginning and 33.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:41:56,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.58 ms. Allocated memory was 52.4 MB in the beginning and 71.3 MB in the end (delta: 18.9 MB). Free memory was 28.1 MB in the beginning and 42.3 MB in the end (delta: -14.2 MB). Peak memory consumption was 3.9 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.32 ms. Allocated memory is still 71.3 MB. Free memory was 42.3 MB in the beginning and 39.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,237 INFO L168 Benchmark]: Boogie Preprocessor took 55.65 ms. Allocated memory is still 71.3 MB. Free memory was 39.3 MB in the beginning and 37.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,237 INFO L168 Benchmark]: RCFGBuilder took 1367.99 ms. Allocated memory was 71.3 MB in the beginning and 113.2 MB in the end (delta: 41.9 MB). Free memory was 37.2 MB in the beginning and 87.1 MB in the end (delta: -49.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,237 INFO L168 Benchmark]: TraceAbstraction took 10299.21 ms. Allocated memory was 113.2 MB in the beginning and 285.2 MB in the end (delta: 172.0 MB). Free memory was 86.7 MB in the beginning and 152.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,238 INFO L168 Benchmark]: Witness Printer took 44.89 ms. Allocated memory is still 285.2 MB. Free memory was 152.8 MB in the beginning and 140.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:56,239 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.14 ms. Allocated memory is still 52.4 MB. Free memory was 33.7 MB in the beginning and 33.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 374.58 ms. Allocated memory was 52.4 MB in the beginning and 71.3 MB in the end (delta: 18.9 MB). Free memory was 28.1 MB in the beginning and 42.3 MB in the end (delta: -14.2 MB). Peak memory consumption was 3.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.32 ms. Allocated memory is still 71.3 MB. Free memory was 42.3 MB in the beginning and 39.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.65 ms. Allocated memory is still 71.3 MB. Free memory was 39.3 MB in the beginning and 37.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1367.99 ms. Allocated memory was 71.3 MB in the beginning and 113.2 MB in the end (delta: 41.9 MB). Free memory was 37.2 MB in the beginning and 87.1 MB in the end (delta: -49.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10299.21 ms. Allocated memory was 113.2 MB in the beginning and 285.2 MB in the end (delta: 172.0 MB). Free memory was 86.7 MB in the beginning and 152.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. * Witness Printer took 44.89 ms. Allocated memory is still 285.2 MB. Free memory was 152.8 MB in the beginning and 140.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7526.2ms, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1734 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 4116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2083, positive: 1948, positive conditional: 0, positive unconditional: 1948, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1222, positive: 1182, positive conditional: 0, positive unconditional: 1182, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1222, positive: 1162, positive conditional: 0, positive unconditional: 1162, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 306, negative conditional: 0, negative unconditional: 306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2083, positive: 766, positive conditional: 0, positive unconditional: 766, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 1222, unknown conditional: 0, unknown unconditional: 1222] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2498; [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10143.0ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 21.5ms, AutomataDifference: 865.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7589.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 415 SDtfs, 543 SDslu, 771 SDs, 0 SdLazy, 355 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 368.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 399.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 177.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 226 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.4ms SsaConstructionTime, 307.0ms SatisfiabilityAnalysisTime, 899.5ms InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 14:41:56,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...