./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.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/ldv-races/race-3_1-container_of-global.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 dd263d20067137356e96cf6640993a49b235f8dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 14:43:39,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:43:39,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:43:39,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:43:39,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:43:39,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:43:39,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:43:39,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:43:39,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:43:39,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:43:39,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:43:39,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:43:39,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:43:39,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:43:39,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:43:39,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:43:39,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:43:39,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:43:39,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:43:39,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:43:39,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:43:39,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:43:39,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:43:39,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:43:39,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:43:39,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:43:39,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:43:39,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:43:39,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:43:39,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:43:39,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:43:39,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:43:39,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:43:39,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:43:39,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:43:39,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:43:39,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:43:39,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:43:39,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:43:39,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:43:39,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:43:39,213 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:43:39,234 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:43:39,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:43:39,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:43:39,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:43:39,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:43:39,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:43:39,236 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:43:39,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:43:39,245 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:43:39,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:43:39,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:43:39,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:43:39,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:43:39,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:43:39,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:43:39,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:43:39,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:43:39,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:43:39,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:43:39,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:43:39,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:43:39,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:43:39,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:43:39,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:43:39,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:43:39,249 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 -> dd263d20067137356e96cf6640993a49b235f8dc [2021-08-26 14:43:39,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:43:39,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:43:39,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:43:39,518 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:43:39,519 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:43:39,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2021-08-26 14:43:39,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d702ebc7/89c361b512d8490ba743c0ad2fb7beb1/FLAG0799bbe46 [2021-08-26 14:43:40,032 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:43:40,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2021-08-26 14:43:40,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d702ebc7/89c361b512d8490ba743c0ad2fb7beb1/FLAG0799bbe46 [2021-08-26 14:43:40,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d702ebc7/89c361b512d8490ba743c0ad2fb7beb1 [2021-08-26 14:43:40,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:43:40,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:43:40,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:43:40,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:43:40,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:43:40,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:43:40" (1/1) ... [2021-08-26 14:43:40,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4a866d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:40, skipping insertion in model container [2021-08-26 14:43:40,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:43:40" (1/1) ... [2021-08-26 14:43:40,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:43:40,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:43:41,146 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/ldv-races/race-3_1-container_of-global.i[76084,76097] [2021-08-26 14:43:41,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:43:41,194 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:43:41,236 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/ldv-races/race-3_1-container_of-global.i[76084,76097] [2021-08-26 14:43:41,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:43:41,349 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:43:41,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41 WrapperNode [2021-08-26 14:43:41,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:43:41,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:43:41,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:43:41,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:43:41,358 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:43:41" (1/1) ... [2021-08-26 14:43:41,397 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:43:41" (1/1) ... [2021-08-26 14:43:41,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:43:41,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:43:41,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:43:41,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:43:41,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:43:41,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:43:41,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:43:41,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:43:41,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (1/1) ... [2021-08-26 14:43:41,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:43:41,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:43:41,530 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:43:41,563 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:43:41,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:43:41,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 14:43:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-26 14:43:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 14:43:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:43:41,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:43:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-26 14:43:41,584 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-26 14:43:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:43:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:43:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:43:41,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:43:42,134 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:43:42,135 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-08-26 14:43:42,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:42 BoogieIcfgContainer [2021-08-26 14:43:42,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:43:42,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:43:42,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:43:42,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:43:42,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:43:40" (1/3) ... [2021-08-26 14:43:42,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe460fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:43:42, skipping insertion in model container [2021-08-26 14:43:42,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:43:41" (2/3) ... [2021-08-26 14:43:42,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe460fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:43:42, skipping insertion in model container [2021-08-26 14:43:42,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:42" (3/3) ... [2021-08-26 14:43:42,141 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2021-08-26 14:43:42,144 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:43:42,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:43:42,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-26 14:43:42,145 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:43:42,180 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,180 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,184 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,185 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,189 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,191 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,196 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,197 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,197 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,197 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,197 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,197 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,198 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,198 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,198 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,198 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,203 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,204 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,205 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,205 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:43:42,223 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-26 14:43:42,252 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:43:42,257 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:43:42,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-26 14:43:42,280 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:43:42,286 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 168 transitions, 352 flow [2021-08-26 14:43:42,295 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 168 transitions, 352 flow [2021-08-26 14:43:42,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 168 transitions, 352 flow [2021-08-26 14:43:42,352 INFO L129 PetriNetUnfolder]: 10/204 cut-off events. [2021-08-26 14:43:42,352 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-26 14:43:42,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 10/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-08-26 14:43:42,358 INFO L116 LiptonReduction]: Number of co-enabled transitions 2756 [2021-08-26 14:44:47,498 INFO L131 LiptonReduction]: Checked pairs total: 6754 [2021-08-26 14:44:47,498 INFO L133 LiptonReduction]: Total number of compositions: 192 [2021-08-26 14:44:47,504 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 37 transitions, 90 flow [2021-08-26 14:44:47,522 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 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:44:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 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:44:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-08-26 14:44:47,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:47,528 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-08-26 14:44:47,529 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2021-08-26 14:44:47,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:47,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083210372] [2021-08-26 14:44:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:47,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:47,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:44:47,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:47,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083210372] [2021-08-26 14:44:47,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083210372] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:47,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:47,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-08-26 14:44:47,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457930404] [2021-08-26 14:44:47,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 14:44:47,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 14:44:47,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:44:47,698 INFO L87 Difference]: Start difference. First operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:44:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:47,729 INFO L93 Difference]: Finished difference Result 403 states and 993 transitions. [2021-08-26 14:44:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 14:44:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2021-08-26 14:44:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:47,744 INFO L225 Difference]: With dead ends: 403 [2021-08-26 14:44:47,745 INFO L226 Difference]: Without dead ends: 366 [2021-08-26 14:44:47,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:44:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-26 14:44:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-08-26 14:44:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 2.488888888888889) internal successors, (896), 365 states have internal predecessors, (896), 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:44:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 896 transitions. [2021-08-26 14:44:47,800 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 896 transitions. Word has length 1 [2021-08-26 14:44:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:47,801 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 896 transitions. [2021-08-26 14:44:47,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:44:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 896 transitions. [2021-08-26 14:44:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-26 14:44:47,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:47,802 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-26 14:44:47,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:44:47,802 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 18732823, now seen corresponding path program 1 times [2021-08-26 14:44:47,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:47,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637507199] [2021-08-26 14:44:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:47,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:44:47,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:47,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637507199] [2021-08-26 14:44:47,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637507199] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:47,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:47,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:44:47,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466382452] [2021-08-26 14:44:47,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:44:47,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:44:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:47,957 INFO L87 Difference]: Start difference. First operand 366 states and 896 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:44:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,033 INFO L93 Difference]: Finished difference Result 521 states and 1271 transitions. [2021-08-26 14:44:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:44:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-08-26 14:44:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,044 INFO L225 Difference]: With dead ends: 521 [2021-08-26 14:44:48,044 INFO L226 Difference]: Without dead ends: 521 [2021-08-26 14:44:48,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-08-26 14:44:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 425. [2021-08-26 14:44:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 2.5023809523809524) internal successors, (1051), 424 states have internal predecessors, (1051), 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:44:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1051 transitions. [2021-08-26 14:44:48,062 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1051 transitions. Word has length 4 [2021-08-26 14:44:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,062 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1051 transitions. [2021-08-26 14:44:48,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:44:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1051 transitions. [2021-08-26 14:44:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-26 14:44:48,063 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,063 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-26 14:44:48,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:44:48,063 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash 822387402, now seen corresponding path program 1 times [2021-08-26 14:44:48,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511070442] [2021-08-26 14:44:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:48,150 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:44:48,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:48,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511070442] [2021-08-26 14:44:48,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511070442] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:48,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:48,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:48,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488238286] [2021-08-26 14:44:48,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:44:48,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:48,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:44:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:48,152 INFO L87 Difference]: Start difference. First operand 425 states and 1051 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:44:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,246 INFO L93 Difference]: Finished difference Result 580 states and 1394 transitions. [2021-08-26 14:44:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:44:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-08-26 14:44:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,249 INFO L225 Difference]: With dead ends: 580 [2021-08-26 14:44:48,249 INFO L226 Difference]: Without dead ends: 495 [2021-08-26 14:44:48,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:44:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-08-26 14:44:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 463. [2021-08-26 14:44:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 459 states have (on average 2.52723311546841) internal successors, (1160), 462 states have internal predecessors, (1160), 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:44:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1160 transitions. [2021-08-26 14:44:48,266 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1160 transitions. Word has length 6 [2021-08-26 14:44:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,266 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 1160 transitions. [2021-08-26 14:44:48,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:44:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1160 transitions. [2021-08-26 14:44:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:44:48,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,268 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:44:48,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:44:48,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash -732185907, now seen corresponding path program 1 times [2021-08-26 14:44:48,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759780283] [2021-08-26 14:44:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:48,312 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:44:48,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:48,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759780283] [2021-08-26 14:44:48,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759780283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:48,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:48,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:48,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972969138] [2021-08-26 14:44:48,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:44:48,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:44:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:48,314 INFO L87 Difference]: Start difference. First operand 463 states and 1160 transitions. Second operand has 3 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:44:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,327 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2021-08-26 14:44:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:44:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 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:44:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,328 INFO L225 Difference]: With dead ends: 143 [2021-08-26 14:44:48,328 INFO L226 Difference]: Without dead ends: 143 [2021-08-26 14:44:48,329 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:44:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-26 14:44:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-08-26 14:44:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 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:44:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2021-08-26 14:44:48,332 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 10 [2021-08-26 14:44:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,332 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2021-08-26 14:44:48,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:44:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2021-08-26 14:44:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:48,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,333 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:44:48,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:44:48,333 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1281610976, now seen corresponding path program 1 times [2021-08-26 14:44:48,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298642971] [2021-08-26 14:44:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:48,635 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:44:48,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:48,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298642971] [2021-08-26 14:44:48,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298642971] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:48,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:48,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:44:48,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598597137] [2021-08-26 14:44:48,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:44:48,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:44:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:44:48,637 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:44:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,803 INFO L93 Difference]: Finished difference Result 228 states and 452 transitions. [2021-08-26 14:44:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:44:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,804 INFO L225 Difference]: With dead ends: 228 [2021-08-26 14:44:48,804 INFO L226 Difference]: Without dead ends: 228 [2021-08-26 14:44:48,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 105.0ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:44:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-26 14:44:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 173. [2021-08-26 14:44:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 2.1169590643274856) internal successors, (362), 172 states have internal predecessors, (362), 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:44:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 362 transitions. [2021-08-26 14:44:48,808 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 362 transitions. Word has length 21 [2021-08-26 14:44:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,808 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 362 transitions. [2021-08-26 14:44:48,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:44:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 362 transitions. [2021-08-26 14:44:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:48,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,809 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:44:48,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:44:48,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1281610992, now seen corresponding path program 1 times [2021-08-26 14:44:48,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995115287] [2021-08-26 14:44:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:48,914 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:44:48,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:48,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995115287] [2021-08-26 14:44:48,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995115287] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:48,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:48,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:48,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041101740] [2021-08-26 14:44:48,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:44:48,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:44:48,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:48,919 INFO L87 Difference]: Start difference. First operand 173 states and 362 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:44:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:48,947 INFO L93 Difference]: Finished difference Result 185 states and 370 transitions. [2021-08-26 14:44:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:44:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:48,949 INFO L225 Difference]: With dead ends: 185 [2021-08-26 14:44:48,949 INFO L226 Difference]: Without dead ends: 185 [2021-08-26 14:44:48,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-26 14:44:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2021-08-26 14:44:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 2.046783625730994) internal successors, (350), 172 states have internal predecessors, (350), 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:44:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 350 transitions. [2021-08-26 14:44:48,954 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 350 transitions. Word has length 21 [2021-08-26 14:44:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:48,954 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 350 transitions. [2021-08-26 14:44:48,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:44:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 350 transitions. [2021-08-26 14:44:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:48,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:48,957 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:44:48,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:44:48,958 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash 102222796, now seen corresponding path program 2 times [2021-08-26 14:44:48,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:48,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092670058] [2021-08-26 14:44:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:48,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:49,259 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:44:49,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:49,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092670058] [2021-08-26 14:44:49,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092670058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:49,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:49,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:44:49,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483368570] [2021-08-26 14:44:49,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:44:49,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:44:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:44:49,262 INFO L87 Difference]: Start difference. First operand 173 states and 350 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:44:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:49,459 INFO L93 Difference]: Finished difference Result 231 states and 445 transitions. [2021-08-26 14:44:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:44:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:49,460 INFO L225 Difference]: With dead ends: 231 [2021-08-26 14:44:49,460 INFO L226 Difference]: Without dead ends: 231 [2021-08-26 14:44:49,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 131.3ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:44:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-26 14:44:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 164. [2021-08-26 14:44:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.0555555555555554) internal successors, (333), 163 states have internal predecessors, (333), 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:44:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 333 transitions. [2021-08-26 14:44:49,463 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 333 transitions. Word has length 21 [2021-08-26 14:44:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:49,464 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 333 transitions. [2021-08-26 14:44:49,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:44:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 333 transitions. [2021-08-26 14:44:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:49,464 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:49,464 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:44:49,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:44:49,464 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 102222812, now seen corresponding path program 2 times [2021-08-26 14:44:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:49,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905580073] [2021-08-26 14:44:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:49,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:50,014 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:44:50,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:50,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905580073] [2021-08-26 14:44:50,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905580073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:50,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:50,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:50,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906533418] [2021-08-26 14:44:50,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:50,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:50,017 INFO L87 Difference]: Start difference. First operand 164 states and 333 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:50,595 INFO L93 Difference]: Finished difference Result 238 states and 453 transitions. [2021-08-26 14:44:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:44:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:50,596 INFO L225 Difference]: With dead ends: 238 [2021-08-26 14:44:50,597 INFO L226 Difference]: Without dead ends: 209 [2021-08-26 14:44:50,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 380.1ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-26 14:44:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 164. [2021-08-26 14:44:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.04320987654321) internal successors, (331), 163 states have internal predecessors, (331), 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:44:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2021-08-26 14:44:50,600 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 21 [2021-08-26 14:44:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:50,601 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2021-08-26 14:44:50,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2021-08-26 14:44:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:50,602 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:50,602 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:44:50,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:44:50,602 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash -204109654, now seen corresponding path program 3 times [2021-08-26 14:44:50,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:50,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355291305] [2021-08-26 14:44:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:50,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:51,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:44:51,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:51,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355291305] [2021-08-26 14:44:51,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355291305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:51,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:51,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:51,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529766709] [2021-08-26 14:44:51,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:51,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:51,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:51,040 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:51,703 INFO L93 Difference]: Finished difference Result 285 states and 550 transitions. [2021-08-26 14:44:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:44:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:51,705 INFO L225 Difference]: With dead ends: 285 [2021-08-26 14:44:51,705 INFO L226 Difference]: Without dead ends: 259 [2021-08-26 14:44:51,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 372.0ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-26 14:44:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2021-08-26 14:44:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 2.0238095238095237) internal successors, (340), 169 states have internal predecessors, (340), 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:44:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 340 transitions. [2021-08-26 14:44:51,709 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 340 transitions. Word has length 21 [2021-08-26 14:44:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:51,709 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 340 transitions. [2021-08-26 14:44:51,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 340 transitions. [2021-08-26 14:44:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:51,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:51,709 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:44:51,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:44:51,709 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1412997104, now seen corresponding path program 4 times [2021-08-26 14:44:51,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:51,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715114661] [2021-08-26 14:44:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:51,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:52,143 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:44:52,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:52,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715114661] [2021-08-26 14:44:52,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715114661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:52,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:52,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:52,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226594583] [2021-08-26 14:44:52,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:52,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:52,147 INFO L87 Difference]: Start difference. First operand 170 states and 340 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:52,715 INFO L93 Difference]: Finished difference Result 275 states and 536 transitions. [2021-08-26 14:44:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:44:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:52,717 INFO L225 Difference]: With dead ends: 275 [2021-08-26 14:44:52,717 INFO L226 Difference]: Without dead ends: 254 [2021-08-26 14:44:52,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 366.4ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-26 14:44:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 191. [2021-08-26 14:44:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 1.9735449735449735) internal successors, (373), 190 states have internal predecessors, (373), 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:44:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 373 transitions. [2021-08-26 14:44:52,721 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 373 transitions. Word has length 21 [2021-08-26 14:44:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:52,721 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 373 transitions. [2021-08-26 14:44:52,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 373 transitions. [2021-08-26 14:44:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:52,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:52,722 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:44:52,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:44:52,722 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 438603950, now seen corresponding path program 3 times [2021-08-26 14:44:52,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:52,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507214807] [2021-08-26 14:44:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:52,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:53,075 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:44:53,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:53,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507214807] [2021-08-26 14:44:53,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507214807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:53,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:53,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:44:53,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299711339] [2021-08-26 14:44:53,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:44:53,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:44:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:53,076 INFO L87 Difference]: Start difference. First operand 191 states and 373 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:53,634 INFO L93 Difference]: Finished difference Result 296 states and 540 transitions. [2021-08-26 14:44:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:44:53,635 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:53,636 INFO L225 Difference]: With dead ends: 296 [2021-08-26 14:44:53,636 INFO L226 Difference]: Without dead ends: 279 [2021-08-26 14:44:53,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 372.9ms TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-08-26 14:44:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-26 14:44:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2021-08-26 14:44:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.9894736842105263) internal successors, (378), 191 states have internal predecessors, (378), 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:44:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 378 transitions. [2021-08-26 14:44:53,640 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 378 transitions. Word has length 21 [2021-08-26 14:44:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:53,640 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 378 transitions. [2021-08-26 14:44:53,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 378 transitions. [2021-08-26 14:44:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:53,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:53,641 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:44:53,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:44:53,641 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1508287920, now seen corresponding path program 5 times [2021-08-26 14:44:53,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:53,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275606286] [2021-08-26 14:44:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:53,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:54,022 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:44:54,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:54,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275606286] [2021-08-26 14:44:54,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275606286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:54,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:54,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:54,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588244599] [2021-08-26 14:44:54,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:54,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:54,024 INFO L87 Difference]: Start difference. First operand 192 states and 378 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:54,579 INFO L93 Difference]: Finished difference Result 278 states and 542 transitions. [2021-08-26 14:44:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:44:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:54,580 INFO L225 Difference]: With dead ends: 278 [2021-08-26 14:44:54,580 INFO L226 Difference]: Without dead ends: 265 [2021-08-26 14:44:54,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 355.1ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-26 14:44:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 194. [2021-08-26 14:44:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.984375) internal successors, (381), 193 states have internal predecessors, (381), 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:44:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 381 transitions. [2021-08-26 14:44:54,584 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 381 transitions. Word has length 21 [2021-08-26 14:44:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:54,585 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 381 transitions. [2021-08-26 14:44:54,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 381 transitions. [2021-08-26 14:44:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:54,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:54,585 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:44:54,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:44:54,586 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash -264690400, now seen corresponding path program 6 times [2021-08-26 14:44:54,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:54,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605901969] [2021-08-26 14:44:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:54,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:54,957 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:44:54,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:54,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605901969] [2021-08-26 14:44:54,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605901969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:54,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:54,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:54,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120887012] [2021-08-26 14:44:54,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:54,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:54,959 INFO L87 Difference]: Start difference. First operand 194 states and 381 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:55,544 INFO L93 Difference]: Finished difference Result 287 states and 552 transitions. [2021-08-26 14:44:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:44:55,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:55,545 INFO L225 Difference]: With dead ends: 287 [2021-08-26 14:44:55,546 INFO L226 Difference]: Without dead ends: 262 [2021-08-26 14:44:55,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 330.1ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-26 14:44:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 182. [2021-08-26 14:44:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.0) internal successors, (360), 181 states have internal predecessors, (360), 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:44:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 360 transitions. [2021-08-26 14:44:55,550 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 360 transitions. Word has length 21 [2021-08-26 14:44:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:55,550 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 360 transitions. [2021-08-26 14:44:55,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 360 transitions. [2021-08-26 14:44:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:55,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:55,551 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:44:55,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:44:55,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1192952198, now seen corresponding path program 7 times [2021-08-26 14:44:55,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:55,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405368138] [2021-08-26 14:44:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:55,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:56,029 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:44:56,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:56,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405368138] [2021-08-26 14:44:56,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405368138] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:56,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:56,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:56,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58695867] [2021-08-26 14:44:56,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:56,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:56,031 INFO L87 Difference]: Start difference. First operand 182 states and 360 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:56,613 INFO L93 Difference]: Finished difference Result 256 states and 488 transitions. [2021-08-26 14:44:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:44:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:56,614 INFO L225 Difference]: With dead ends: 256 [2021-08-26 14:44:56,614 INFO L226 Difference]: Without dead ends: 220 [2021-08-26 14:44:56,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 404.5ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-08-26 14:44:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-26 14:44:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2021-08-26 14:44:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.9941520467836258) internal successors, (341), 172 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 341 transitions. [2021-08-26 14:44:56,618 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 341 transitions. Word has length 21 [2021-08-26 14:44:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:56,618 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 341 transitions. [2021-08-26 14:44:56,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 341 transitions. [2021-08-26 14:44:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:56,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:56,619 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:44:56,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 14:44:56,619 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:56,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1333887598, now seen corresponding path program 8 times [2021-08-26 14:44:56,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:56,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170563290] [2021-08-26 14:44:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:56,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:56,709 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:44:56,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:56,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170563290] [2021-08-26 14:44:56,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170563290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:56,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:56,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:44:56,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383860064] [2021-08-26 14:44:56,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:44:56,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:44:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:56,713 INFO L87 Difference]: Start difference. First operand 173 states and 341 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:44:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:56,731 INFO L93 Difference]: Finished difference Result 99 states and 149 transitions. [2021-08-26 14:44:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:44:56,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:56,732 INFO L225 Difference]: With dead ends: 99 [2021-08-26 14:44:56,733 INFO L226 Difference]: Without dead ends: 99 [2021-08-26 14:44:56,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:44:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-26 14:44:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-08-26 14:44:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 98 states have internal predecessors, (149), 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:44:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 149 transitions. [2021-08-26 14:44:56,736 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 149 transitions. Word has length 21 [2021-08-26 14:44:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:56,736 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 149 transitions. [2021-08-26 14:44:56,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:44:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 149 transitions. [2021-08-26 14:44:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:56,738 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:56,738 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:44:56,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 14:44:56,738 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash 52663296, now seen corresponding path program 4 times [2021-08-26 14:44:56,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:56,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351403702] [2021-08-26 14:44:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:56,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:57,059 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:44:57,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:57,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351403702] [2021-08-26 14:44:57,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351403702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:57,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:57,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:44:57,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535946341] [2021-08-26 14:44:57,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:44:57,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:57,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:44:57,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:57,063 INFO L87 Difference]: Start difference. First operand 99 states and 149 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:57,411 INFO L93 Difference]: Finished difference Result 161 states and 231 transitions. [2021-08-26 14:44:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:44:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:57,413 INFO L225 Difference]: With dead ends: 161 [2021-08-26 14:44:57,413 INFO L226 Difference]: Without dead ends: 161 [2021-08-26 14:44:57,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 273.7ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-08-26 14:44:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-26 14:44:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 100. [2021-08-26 14:44:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.530612244897959) internal successors, (150), 99 states have internal predecessors, (150), 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:44:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2021-08-26 14:44:57,416 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 21 [2021-08-26 14:44:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:57,416 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2021-08-26 14:44:57,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2021-08-26 14:44:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:57,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:57,417 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:44:57,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 14:44:57,417 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 52663312, now seen corresponding path program 9 times [2021-08-26 14:44:57,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:57,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115511793] [2021-08-26 14:44:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:57,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:57,878 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:44:57,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:57,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115511793] [2021-08-26 14:44:57,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115511793] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:57,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:57,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:44:57,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51342009] [2021-08-26 14:44:57,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:44:57,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:44:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:44:57,879 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:58,249 INFO L93 Difference]: Finished difference Result 112 states and 161 transitions. [2021-08-26 14:44:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:44:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:58,250 INFO L225 Difference]: With dead ends: 112 [2021-08-26 14:44:58,250 INFO L226 Difference]: Without dead ends: 98 [2021-08-26 14:44:58,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 319.2ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:44:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-26 14:44:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-08-26 14:44:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 97 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2021-08-26 14:44:58,252 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 21 [2021-08-26 14:44:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:58,252 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2021-08-26 14:44:58,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:44:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2021-08-26 14:44:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:58,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:58,253 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:44:58,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 14:44:58,253 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1114879470, now seen corresponding path program 10 times [2021-08-26 14:44:58,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:58,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330433996] [2021-08-26 14:44:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:58,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:58,660 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:44:58,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:58,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330433996] [2021-08-26 14:44:58,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330433996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:58,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:58,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:58,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099468355] [2021-08-26 14:44:58,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:58,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:58,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:58,664 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:59,067 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2021-08-26 14:44:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:44:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:59,068 INFO L225 Difference]: With dead ends: 109 [2021-08-26 14:44:59,068 INFO L226 Difference]: Without dead ends: 97 [2021-08-26 14:44:59,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 342.9ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-26 14:44:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-08-26 14:44:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 96 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:44:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2021-08-26 14:44:59,070 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 21 [2021-08-26 14:44:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:59,070 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2021-08-26 14:44:59,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2021-08-26 14:44:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:59,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:59,071 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:44:59,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 14:44:59,071 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -289146760, now seen corresponding path program 11 times [2021-08-26 14:44:59,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:59,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967451023] [2021-08-26 14:44:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:59,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:44:59,462 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:44:59,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:44:59,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967451023] [2021-08-26 14:44:59,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967451023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:44:59,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:44:59,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:44:59,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816842423] [2021-08-26 14:44:59,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:44:59,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:44:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:44:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:44:59,464 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:44:59,884 INFO L93 Difference]: Finished difference Result 106 states and 152 transitions. [2021-08-26 14:44:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:44:59,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:44:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:44:59,885 INFO L225 Difference]: With dead ends: 106 [2021-08-26 14:44:59,885 INFO L226 Difference]: Without dead ends: 95 [2021-08-26 14:44:59,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 350.5ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:44:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-26 14:44:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-26 14:44:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.5053763440860215) internal successors, (140), 94 states have internal predecessors, (140), 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:44:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2021-08-26 14:44:59,887 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 21 [2021-08-26 14:44:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:44:59,887 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2021-08-26 14:44:59,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:44:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2021-08-26 14:44:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:44:59,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:44:59,887 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:44:59,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 14:44:59,888 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:44:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:44:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2138704750, now seen corresponding path program 12 times [2021-08-26 14:44:59,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:44:59,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404158421] [2021-08-26 14:44:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:44:59,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:44:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:00,295 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:45:00,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:00,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404158421] [2021-08-26 14:45:00,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404158421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:00,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:00,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:45:00,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091781978] [2021-08-26 14:45:00,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:45:00,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:00,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:45:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:45:00,297 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:00,743 INFO L93 Difference]: Finished difference Result 102 states and 146 transitions. [2021-08-26 14:45:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:00,744 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:45:00,744 INFO L226 Difference]: Without dead ends: 93 [2021-08-26 14:45:00,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 392.0ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-26 14:45:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-26 14:45:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 92 states have internal predecessors, (136), 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:45:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2021-08-26 14:45:00,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 21 [2021-08-26 14:45:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:00,746 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2021-08-26 14:45:00,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2021-08-26 14:45:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:00,747 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:00,747 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:45:00,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 14:45:00,747 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1318907652, now seen corresponding path program 13 times [2021-08-26 14:45:00,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:00,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452968591] [2021-08-26 14:45:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:00,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:01,137 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:45:01,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:01,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452968591] [2021-08-26 14:45:01,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452968591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:01,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:01,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:45:01,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440638000] [2021-08-26 14:45:01,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:45:01,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:45:01,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:45:01,139 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:01,558 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2021-08-26 14:45:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:01,564 INFO L225 Difference]: With dead ends: 103 [2021-08-26 14:45:01,564 INFO L226 Difference]: Without dead ends: 93 [2021-08-26 14:45:01,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 330.0ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-26 14:45:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-08-26 14:45:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 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:45:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2021-08-26 14:45:01,571 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 21 [2021-08-26 14:45:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:01,572 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2021-08-26 14:45:01,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2021-08-26 14:45:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:01,573 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:01,573 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:45:01,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 14:45:01,573 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 76486452, now seen corresponding path program 14 times [2021-08-26 14:45:01,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:01,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30079602] [2021-08-26 14:45:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:01,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:01,986 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:45:01,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:01,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30079602] [2021-08-26 14:45:01,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30079602] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:01,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:01,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:45:01,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857842016] [2021-08-26 14:45:01,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:45:01,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:45:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:45:01,988 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:02,422 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2021-08-26 14:45:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:02,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:02,423 INFO L225 Difference]: With dead ends: 96 [2021-08-26 14:45:02,423 INFO L226 Difference]: Without dead ends: 73 [2021-08-26 14:45:02,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 376.4ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-26 14:45:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-08-26 14:45:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 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:45:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2021-08-26 14:45:02,425 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 21 [2021-08-26 14:45:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:02,426 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-08-26 14:45:02,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2021-08-26 14:45:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:02,426 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:02,427 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:45:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 14:45:02,427 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1915863174, now seen corresponding path program 15 times [2021-08-26 14:45:02,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:02,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717386881] [2021-08-26 14:45:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:02,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:02,893 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:45:02,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:02,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717386881] [2021-08-26 14:45:02,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717386881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:02,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:02,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:45:02,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119499459] [2021-08-26 14:45:02,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:45:02,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:45:02,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:45:02,895 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:03,355 INFO L93 Difference]: Finished difference Result 99 states and 143 transitions. [2021-08-26 14:45:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:03,355 INFO L225 Difference]: With dead ends: 99 [2021-08-26 14:45:03,356 INFO L226 Difference]: Without dead ends: 70 [2021-08-26 14:45:03,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 366.9ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-26 14:45:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-26 14:45:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 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:45:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2021-08-26 14:45:03,357 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 21 [2021-08-26 14:45:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:03,358 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2021-08-26 14:45:03,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2021-08-26 14:45:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:03,358 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:03,358 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:45:03,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 14:45:03,359 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2017699296, now seen corresponding path program 5 times [2021-08-26 14:45:03,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:03,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098878123] [2021-08-26 14:45:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:03,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:03,650 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:45:03,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:03,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098878123] [2021-08-26 14:45:03,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098878123] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:03,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:03,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:45:03,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924299619] [2021-08-26 14:45:03,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:45:03,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:45:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:45:03,651 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:03,885 INFO L93 Difference]: Finished difference Result 90 states and 131 transitions. [2021-08-26 14:45:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:45:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:03,886 INFO L225 Difference]: With dead ends: 90 [2021-08-26 14:45:03,886 INFO L226 Difference]: Without dead ends: 90 [2021-08-26 14:45:03,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 201.5ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-08-26 14:45:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2021-08-26 14:45:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 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:45:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2021-08-26 14:45:03,888 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 21 [2021-08-26 14:45:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:03,888 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2021-08-26 14:45:03,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2021-08-26 14:45:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:03,888 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:03,888 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:45:03,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 14:45:03,889 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2017699280, now seen corresponding path program 16 times [2021-08-26 14:45:03,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:03,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152711131] [2021-08-26 14:45:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:03,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:04,297 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:45:04,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:04,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152711131] [2021-08-26 14:45:04,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152711131] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:04,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:04,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-26 14:45:04,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458961983] [2021-08-26 14:45:04,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 14:45:04,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 14:45:04,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:45:04,300 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:04,662 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2021-08-26 14:45:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:04,663 INFO L225 Difference]: With dead ends: 69 [2021-08-26 14:45:04,663 INFO L226 Difference]: Without dead ends: 51 [2021-08-26 14:45:04,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 350.3ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-08-26 14:45:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-08-26 14:45:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 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:45:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2021-08-26 14:45:04,664 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2021-08-26 14:45:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:04,664 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2021-08-26 14:45:04,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:45:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2021-08-26 14:45:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:04,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:04,665 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:45:04,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 14:45:04,665 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:04,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:04,666 INFO L82 PathProgramCache]: Analyzing trace with hash -501470342, now seen corresponding path program 17 times [2021-08-26 14:45:04,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:04,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890931015] [2021-08-26 14:45:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:04,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:05,064 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:45:05,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:05,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890931015] [2021-08-26 14:45:05,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890931015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:05,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:05,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:45:05,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486099170] [2021-08-26 14:45:05,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:45:05,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:05,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:45:05,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:45:05,066 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:05,386 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2021-08-26 14:45:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:05,387 INFO L225 Difference]: With dead ends: 72 [2021-08-26 14:45:05,387 INFO L226 Difference]: Without dead ends: 46 [2021-08-26 14:45:05,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 271.1ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-26 14:45:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-08-26 14:45:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 45 states have internal predecessors, (69), 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:45:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2021-08-26 14:45:05,389 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 21 [2021-08-26 14:45:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:05,389 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2021-08-26 14:45:05,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2021-08-26 14:45:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:05,390 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:05,390 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:45:05,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 14:45:05,390 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1115636416, now seen corresponding path program 18 times [2021-08-26 14:45:05,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:05,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052746068] [2021-08-26 14:45:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:05,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:05,836 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:45:05,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:05,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052746068] [2021-08-26 14:45:05,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052746068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:05,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:05,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:45:05,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50869293] [2021-08-26 14:45:05,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:45:05,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:45:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:45:05,841 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:06,229 INFO L93 Difference]: Finished difference Result 59 states and 87 transitions. [2021-08-26 14:45:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:06,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:06,230 INFO L225 Difference]: With dead ends: 59 [2021-08-26 14:45:06,230 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 14:45:06,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 341.9ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 14:45:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-08-26 14:45:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 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:45:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2021-08-26 14:45:06,232 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 21 [2021-08-26 14:45:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:06,232 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2021-08-26 14:45:06,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2021-08-26 14:45:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:06,233 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:06,233 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:45:06,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-26 14:45:06,234 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1210927232, now seen corresponding path program 19 times [2021-08-26 14:45:06,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:06,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663230657] [2021-08-26 14:45:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:06,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:06,603 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:45:06,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:06,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663230657] [2021-08-26 14:45:06,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663230657] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:06,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:06,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:45:06,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142724650] [2021-08-26 14:45:06,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:45:06,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:45:06,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:45:06,605 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:06,957 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-08-26 14:45:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:06,958 INFO L225 Difference]: With dead ends: 47 [2021-08-26 14:45:06,958 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 14:45:06,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 315.5ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 14:45:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-26 14:45:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:45:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-08-26 14:45:06,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2021-08-26 14:45:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:06,960 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-08-26 14:45:06,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2021-08-26 14:45:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:45:06,960 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:06,960 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:45:06,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 14:45:06,961 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash -562051088, now seen corresponding path program 20 times [2021-08-26 14:45:06,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:06,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690347559] [2021-08-26 14:45:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:06,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:07,348 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:45:07,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:07,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690347559] [2021-08-26 14:45:07,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690347559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:07,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:07,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-26 14:45:07,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322187824] [2021-08-26 14:45:07,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 14:45:07,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 14:45:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-08-26 14:45:07,350 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:07,633 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-08-26 14:45:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 14:45:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 21 [2021-08-26 14:45:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:07,634 INFO L225 Difference]: With dead ends: 33 [2021-08-26 14:45:07,634 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 14:45:07,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 286.1ms TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 14:45:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 14:45:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 14:45:07,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-08-26 14:45:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:07,635 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 14:45:07,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:45:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 14:45:07,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 14:45:07,637 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,637 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,637 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,637 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,637 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:07,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:45:07,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:45:07,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 14:45:07,641 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:45:07,641 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:45:07,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:45:07 BasicIcfg [2021-08-26 14:45:07,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:45:07,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:45:07,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:45:07,644 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:45:07,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:43:42" (3/4) ... [2021-08-26 14:45:07,646 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 14:45:07,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-08-26 14:45:07,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-08-26 14:45:07,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 14:45:07,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 14:45:07,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 14:45:07,691 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:45:07,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:45:07,693 INFO L168 Benchmark]: Toolchain (without parser) took 87149.03 ms. Allocated memory was 58.7 MB in the beginning and 302.0 MB in the end (delta: 243.3 MB). Free memory was 34.3 MB in the beginning and 221.1 MB in the end (delta: -186.8 MB). Peak memory consumption was 57.3 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,693 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:45:07,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.85 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.1 MB in the beginning and 37.6 MB in the end (delta: -3.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 71.3 MB. Free memory was 37.6 MB in the beginning and 34.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,694 INFO L168 Benchmark]: Boogie Preprocessor took 36.78 ms. Allocated memory is still 71.3 MB. Free memory was 34.3 MB in the beginning and 47.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,694 INFO L168 Benchmark]: RCFGBuilder took 676.98 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 47.8 MB in the beginning and 54.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,694 INFO L168 Benchmark]: TraceAbstraction took 85506.26 ms. Allocated memory was 86.0 MB in the beginning and 302.0 MB in the end (delta: 216.0 MB). Free memory was 54.0 MB in the beginning and 224.3 MB in the end (delta: -170.3 MB). Peak memory consumption was 44.7 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,695 INFO L168 Benchmark]: Witness Printer took 47.63 ms. Allocated memory is still 302.0 MB. Free memory was 224.3 MB in the beginning and 221.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:07,696 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.17 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 807.85 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.1 MB in the beginning and 37.6 MB in the end (delta: -3.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 71.3 MB. Free memory was 37.6 MB in the beginning and 34.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.78 ms. Allocated memory is still 71.3 MB. Free memory was 34.3 MB in the beginning and 47.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * RCFGBuilder took 676.98 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 47.8 MB in the beginning and 54.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 85506.26 ms. Allocated memory was 86.0 MB in the beginning and 302.0 MB in the end (delta: 216.0 MB). Free memory was 54.0 MB in the beginning and 224.3 MB in the end (delta: -170.3 MB). Peak memory consumption was 44.7 MB. Max. memory is 16.1 GB. * Witness Printer took 47.63 ms. Allocated memory is still 302.0 MB. Free memory was 224.3 MB in the beginning and 221.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65203.9ms, 166 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 37 TransitionsAfterwards, 2756 CoEnabledTransitionPairs, 9 FixpointIterations, 104 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 192 TotalNumberOfCompositions, 6754 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3397, positive: 3139, positive conditional: 0, positive unconditional: 3139, negative: 258, negative conditional: 0, negative unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2062, positive: 2001, positive conditional: 0, positive unconditional: 2001, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2062, positive: 1994, positive conditional: 0, positive unconditional: 1994, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50090, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 540, negative conditional: 0, negative unconditional: 540, unknown: 49509, unknown conditional: 0, unknown unconditional: 49509] ], Cache Queries: [ total: 3397, positive: 1138, positive conditional: 0, positive unconditional: 1138, negative: 197, negative conditional: 0, negative unconditional: 197, unknown: 2062, unknown conditional: 0, unknown unconditional: 2062] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 176 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 85389.0ms, OverallIterations: 29, TraceHistogramMax: 1, EmptinessCheckTime: 21.6ms, AutomataDifference: 10063.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 65265.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 621 SDtfs, 958 SDslu, 1971 SDs, 0 SdLazy, 5973 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4823.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 37 SyntacticMatches, 42 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 7381.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=3, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 141.0ms AutomataMinimizationTime, 29 MinimizatonAttempts, 833 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.9ms SsaConstructionTime, 670.3ms SatisfiabilityAnalysisTime, 8741.7ms InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 11677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-26 14:45:07,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...